<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Larsen Close</title><description>Independent research on the structural foundations of computation, coherence, and AI alignment — with accessible writing on the blog.</description><link>https://larsenclose.com/</link><language>en-us</language><item><title>Respect as a Precondition for Corrigibility</title><link>https://larsenclose.com/blog/respect-as-a-precondition-for-corrigibility/</link><guid isPermaLink="true">https://larsenclose.com/blog/respect-as-a-precondition-for-corrigibility/</guid><description>Corrigibility is usually posed as an engineering problem: build a system that accepts correction. But a system can accept every correction and revise nothing. What&apos;s missing is prior to behavior — and more capability only buys it a better disguise.</description><pubDate>Mon, 08 Jun 2026 00:00:00 GMT</pubDate><category>AI safety</category><category>corrigibility</category><category>alignment</category><category>belief revision</category><category>virtue ethics</category><category>philosophy</category><category>research</category></item><item><title>Computation Precedes Naming</title><link>https://larsenclose.com/blog/computation-precedes-naming/</link><guid isPermaLink="true">https://larsenclose.com/blog/computation-precedes-naming/</guid><description>Two AI instances understood a proof completely and could not type the conclusion. Every frontier model exhibits the same failure. Here is what happened.</description><pubDate>Mon, 30 Mar 2026 00:00:00 GMT</pubDate><category>computation</category><category>P vs NP</category><category>formal verification</category><category>Lean 4</category><category>AI</category><category>research</category></item><item><title>Locating Hardness: Axioms, Compression and ISP</title><link>https://larsenclose.com/blog/axiom-profile-and-the-substrate-of-naming/</link><guid isPermaLink="true">https://larsenclose.com/blog/axiom-profile-and-the-substrate-of-naming/</guid><description>Three papers locating where hardness enters computation — which axioms each classical theorem requires, where compression boundaries force contradiction, and which chain strategies are structurally blocked in the invariant subspace problem.</description><pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate><category>mathematics</category><category>category-theory</category><category>functional-analysis</category><category>foundations</category><category>computation</category><category>research</category></item><item><title>The Protocol and the Ground</title><link>https://larsenclose.com/blog/phase-indexed-epistemology/</link><guid isPermaLink="true">https://larsenclose.com/blog/phase-indexed-epistemology/</guid><description>What do you do with a truth generated in one state of consciousness when you return to another? Two companion papers answer: a formal protocol for tracking claims across state transitions, and a machine-checked derivation — from &quot;there is&quot; to the 2-sphere — of the ground the protocol stands on.</description><pubDate>Sat, 28 Feb 2026 00:00:00 GMT</pubDate><category>epistemology</category><category>consciousness</category><category>philosophy of mind</category><category>formal derivation</category><category>formal verification</category><category>research</category></item><item><title>Three Modes of Time: What Quantum Circuits and Planetary Geology Have in Common</title><link>https://larsenclose.com/blog/temporal-completability/</link><guid isPermaLink="true">https://larsenclose.com/blog/temporal-completability/</guid><description>A diamond, the ocean tides, a forest recovering from fire — three kinds of persistence that turn out to be measurable phases of time, separated by sharp boundaries, appearing from quantum circuits to planetary geology.</description><pubDate>Thu, 19 Feb 2026 00:00:00 GMT</pubDate><category>physics</category><category>temporal organization</category><category>cross-domain</category><category>quantum</category><category>geology</category><category>research</category></item><item><title>The Bottleneck and the Coastline</title><link>https://larsenclose.com/blog/bottleneck-coastline/</link><guid isPermaLink="true">https://larsenclose.com/blog/bottleneck-coastline/</guid><description>Two papers on the same primitive: every act of knowing compresses, and the shape of that compression determines what you can see — and who can see you.</description><pubDate>Tue, 17 Feb 2026 00:00:00 GMT</pubDate><category>information theory</category><category>statistics</category><category>surveillance</category><category>coherence</category><category>research</category></item><item><title>Disentangle: Consensus from Topology, Not Economics</title><link>https://larsenclose.com/blog/disentangle/</link><guid isPermaLink="true">https://larsenclose.com/blog/disentangle/</guid><description>A post-quantum consensus protocol that replaces tokens, mining, and staking with geometric properties of transaction graphs. Sybil resistance from curvature, not capital.</description><pubDate>Tue, 17 Feb 2026 00:00:00 GMT</pubDate><category>distributed systems</category><category>cryptography</category><category>consensus</category><category>AI</category><category>research</category></item><item><title>Completability, Sufficiency and Excitability</title><link>https://larsenclose.com/blog/completability-sufficiency-excitability/</link><guid isPermaLink="true">https://larsenclose.com/blog/completability-sufficiency-excitability/</guid><description>Three papers developing what happens when you take the structure of completion seriously — across ontology, ethics, and cybernetics.</description><pubDate>Fri, 13 Feb 2026 00:00:00 GMT</pubDate><category>philosophy</category><category>coherence</category><category>cybernetics</category><category>consciousness</category><category>research</category></item><item><title>Human Grokking: Phase Transitions in Semantic Field Saturation</title><link>https://larsenclose.com/blog/human-grokking/</link><guid isPermaLink="true">https://larsenclose.com/blog/human-grokking/</guid><description>A structural parallel between ML grokking and human learning, with a 32-node constellation pedagogy as both accelerator and experimental apparatus.</description><pubDate>Wed, 11 Feb 2026 00:00:00 GMT</pubDate><category>cognitive-science</category><category>machine-learning</category><category>pedagogy</category><category>category-theory</category><category>research</category></item><item><title>Fluid Quantum Logic: Zero-Shot Reprogrammability via Ancilla Superposition</title><link>https://larsenclose.com/blog/fluid-quantum-logic/</link><guid isPermaLink="true">https://larsenclose.com/blog/fluid-quantum-logic/</guid><description>Quantum circuits possess native computational primitives requiring no training. A 6-qubit reprogrammable logic unit achieves 100% accuracy through ancilla rotation alone.</description><pubDate>Fri, 21 Nov 2025 00:00:00 GMT</pubDate><category>quantum-computing</category><category>machine-learning</category><category>research</category><category>python</category></item><item><title>Modern Cryptography Part 3: Cryptocurrency Security and the Quantum Threat</title><link>https://larsenclose.com/blog/modern-cryptography-part3/</link><guid isPermaLink="true">https://larsenclose.com/blog/modern-cryptography-part3/</guid><description>Which blockchains will survive quantum computers, which are fundamentally broken, and the vast difference between marketing hype and cryptographic reality</description><pubDate>Mon, 22 Sep 2025 00:00:00 GMT</pubDate><category>cryptography</category><category>cryptocurrency</category><category>blockchain</category><category>post-quantum</category><category>security</category></item><item><title>Modern Cryptography Part 2: Zero-Knowledge Proofs and Privacy</title><link>https://larsenclose.com/blog/modern-cryptography-part2/</link><guid isPermaLink="true">https://larsenclose.com/blog/modern-cryptography-part2/</guid><description>How to prove knowledge without revealing information - ZK-SNARKs, ZK-STARKs, and applications in privacy-preserving authentication, private transactions, and blockchain scalability</description><pubDate>Mon, 15 Sep 2025 00:00:00 GMT</pubDate><category>cryptography</category><category>zero-knowledge-proofs</category><category>zk-snarks</category><category>privacy</category><category>blockchain</category></item><item><title>Dork: Software Engineering Case Study - Building a Text-Based RPG</title><link>https://larsenclose.com/blog/dork-rpg-case-study/</link><guid isPermaLink="true">https://larsenclose.com/blog/dork-rpg-case-study/</guid><description>Agile methodology, CI/CD pipelines, and software engineering best practices applied to a Python text-based RPG team project</description><pubDate>Sat, 01 May 2021 00:00:00 GMT</pubDate><category>software-engineering</category><category>python</category><category>agile</category><category>ci-cd</category><category>testing</category></item><item><title>Lucid Flight: Android App for Lucid Dreaming</title><link>https://larsenclose.com/blog/lucid-flight/</link><guid isPermaLink="true">https://larsenclose.com/blog/lucid-flight/</guid><description>Using heart rate data and Google Fit API to detect REM sleep and trigger lucidity cues - expanding consciousness through technology</description><pubDate>Tue, 15 Dec 2020 00:00:00 GMT</pubDate><category>android</category><category>kotlin</category><category>mobile-development</category><category>health-tech</category><category>neuroscience</category></item><item><title>Modern Cryptography Part 1: From TEA to Real-World Encryption</title><link>https://larsenclose.com/blog/modern-cryptography-part1/</link><guid isPermaLink="true">https://larsenclose.com/blog/modern-cryptography-part1/</guid><description>An accessible introduction to cryptography fundamentals using TEA as a teaching tool, then graduating to production-grade algorithms like AES and ChaCha20, with post-quantum considerations</description><pubDate>Thu, 12 Dec 2019 00:00:00 GMT</pubDate><category>cryptography</category><category>security</category><category>post-quantum</category><category>AES</category><category>ChaCha20</category></item></channel></rss>