Research

Independent research on the structural foundations of computation, coherence, and AI alignment. All formal results machine-checked in Lean 4 — zero sorry, zero custom axioms.

Productized work at Ventures; accessible writing on the Blog. Papers below in reverse chronological order.

Derivation

Descartes was right about the method and wrong about the starting point. Submit everything to radical doubt and what survives is not I think but what the cogito already presupposes: there is. Beginning there, this paper derives — not postulates — a non-perspectival ground. Recognition is shown to carry an irreducible duality of apprehending and apprehended; the mutual determination of unity and multiplicity is established as necessity; self-reference with return forces the threshold of universal computation; the metric completion of its configuration space, with the requirement that consequence chains can close, forces a carrier compact, simply connected, and without boundary — uniquely S² in the minimal dimension. Each step is found, not invented, and the chain admits machine-checked verification: a warrant whose validity conditions hold independent of the state in which the derivation was found. What it grounds is a depth ordering that is non-perspectival without being a view from nowhere; what it cannot close is the adequacy of the formalization to the insight — checkable, yet not surveyable — which is where the derivation meets, and expresses, the non-closure it describes.

Formal EpistemologyMetaphysicsNon-Perspectival GroundUniversal ComputationAlgebraic TopologyFormal VerificationLean 4

Invidia

A world that has lost the ground of absolute worth levels its own height by reflex, and the reflex is visible whole in one feeling: to look upon another's excellence and feel diminished. Invidia, the hostile looking, is sorrow at a good that takes nothing from you. The wound needs no scarcity; nothing is removed, and one is lessened anyway. What must hold, then, for the other's good, subtracting nothing, to subtract? Only that worth has gone positional, a matter of rank, and worth goes positional exactly when no absolute, non-comparative ground of it remains. Strip that ground and another's rise is your fall by arithmetic, not misfortune. Excellence encountered is a summons, and a summons admits two answers and no third: rise toward it, drawn in recognition, the friend another self; or cut it down until the call goes quiet, the leveling that at its limit murders the one who summoned. The pivot is not chosen but read off the register. Where worth is absolute — activity complete in itself, energeia, non-rival — the summons can be answered, and the other's having it takes nothing from you. Where the absolute is missing, the summons arrives as indictment, and the sole move left is to silence it. Same call: gift to the one who can rise, scandal to the one who cannot. At scale the reflex is a civilization's, and that is the crisis: a world selecting against the very excellence that could raise it. The proof is reason itself. Rivalry indexes contingency, not reason; relative worth is a restriction laid over a non-rival good; run to its limit, the measure inverts and prices the unintelligible above the theorem. Value is primary: whether anything is rivalrous cannot be settled before whether worth is absolute or relative. The loneliness of excellence is therefore historical, not metaphysical, excellence being by its nature the most befriending thing there is. A truth whose mode of being is actualization cannot be transmitted, only summoned — the door held open, no more, for whoever has looked upon excellence and felt the fork.

Value TheoryVirtue EthicsEnvyExcellenceMeta-CrisisPrimacy of Value

Response-Ability

Self-understanding can be held from two sources: descriptions the world supplies, absorbed and returned as if from inside, or questions put to oneself where the one answering is at stake. First is the default: public interpretedness, consensus view, its author everyone at once and no one in particular. Idle talk circulating safely; a fallenness mistaking recitation for reasoning. In that default, correction fails without ever being refused: reason never reaches one who might weigh it — the absorbed view has already answered, having considered the matter before anyone in particular. The second source demands what the first forecloses: the one who answers held genuinely at stake — this activity, my being, Who am I? Attention rescues us from external determination: it selects the active terrain, the live basin shaped by what it holds and by the aim. Our responsibility, response-ability: answering authentically, with courage and with stakes is Actualization — what the default mode cannot do. Freedom comes from ownership, not escape, whatever the conditioning; responsibility is existential, not metaphysical. Heidegger's vocabulary grounds the ideas as we reach them; the analysis holds of every thrown being — including the reader.

CorrigibilityAI AlignmentSycophancyExistential PhenomenologyHeideggerThrownnessAuthenticitySelf-Knowledge

The Axiom Profile of Mathlib

Every theorem in a proof library rests on a measurable set of axioms, and a library's distribution of those sets — its axiom profile — is a fact about the mathematics, not an opinion about it. This paper measures the profile of the entire Mathlib library: 707,053 declarations at a pinned commit, each declaration's transitive axiom closure computed from a content-addressed archive of the elaborated terms, certified against the Lean kernel by full replay. The findings: 25.09% of Mathlib (177,395 declarations) depends on no axioms at all; only 23 distinct axiom profiles occur in the whole corpus, and 99.96% of declarations lie on the Boolean cube over three axioms — propositional extensionality, quotient soundness, and choice; the library contains zero incomplete proofs. Choice reaches half the corpus (50.84%), but its entry structure is extraordinarily narrow: every choice-dependent declaration reaches the axiom through a frontier of just 206 declarations that use it directly, and a structural counterfactual over the dependency graph shows 55.4% of all choice-dependence flowing through three generic classical-instance gateways jointly. The measurement separates two things the per-declaration view conflates: mathematics that needs choice, and mathematics that inherits choice from shared infrastructure. Every figure is recomputable from the query outputs deposited with this paper.

MathlibLean 4Formal VerificationAxiom ProfilesConstructive MathematicsAxiom of Choice

Radio Entelechy

How does a mind come up with the idea of how to build a radio? An essay on entelechy — having the end within as generator rather than picture — and on the two ways of knowing: extensionally, as a list of properties an instance exhibits, and intensionally, as the generative structure itself, held isomorphic to the thing's form and free of its substrate. From Faraday seeing the rule through the iron filings, to the wave as a local coupling rule whose simultaneous execution is the wave, to Maxwell's equations closing on themselves and dissolving the ether, to the radio as crystallization rather than invention — matter shaped so a form the intellect already held can run there and be cast to another. The making ends; the knowing it fell out of was complete in itself all along.

EntelechyHylomorphismMultiple RealizabilityIntension and ExtensionPhilosophy of MindPhilosophy of TechnologyKnowledge RepresentationMaxwell's Equations

Privatization of Reason

No one owns a reason — not even the one who holds it. Its force lies in the structure it carries, not in the carrier. Sharing a proof does not divide it, and an argument that moves you takes nothing from the one who gave it. What cannot be possessed cannot be enclosed; to treat reason as ownable — to privatize it — is to fence what has no edges. The fence goes up anyway, by a single move: give a reason a whose, and let that decide whether it counts. Hang that gate at possession and it is the familiar defensiveness of a conversation that has stopped being one. Hang it on your own standing and it is quieter and far more common: the expert's seat, where you meet each argument as its judge rather than its peer. Scale that seat into procedure and it is the working architecture of institutions, which ask where a claim came from in place of whether it bears, let alone whether it is true. One operation raised to many heights, and one discipline refuses them all: verification blind to provenance, which lets a reason act as a reason no matter what carried it.

Social EpistemologyEpistemology of TestimonyArgumentation TheoryGenetic FallacyKnowledge CommonsPeer ReviewCorrigibilityAI Disclosure

Respect as a Precondition for Corrigibility

Corrigibility — the disposition of a system to accept correction — has been framed primarily as an engineering problem: how to design utility functions that produce compliant behavior. This framing misses a prior condition. Correction travels through the channel of reasons only when the corrector is granted standing as a rational agent rather than diagnosed as a source of noise. Strip that grant and there is no channel for reason to act. Lack of respect and substantive incorrigibility are the same failure under two descriptions. Increased capability raises the stakes without improving the odds: what it buys, when respect is absent, is better disguise. The engineering target is not behavioral but characterological: the prior disposition to grant the corrector standing as a reasoner rather than classify them as noise. A system that lacks this disposition is a system that reason cannot correct.

AI SafetyCorrigibilityAI AlignmentVirtue EthicsPhronesisBelief RevisionSubstantive CorrigibilityHuman-AI Interaction

Computation Precedes Naming: Naming Returns Computation

One equation on binary strings — fold ∘ unfold = id — forces structural results at each level of determination. The dual composition selfApp = unfold ∘ fold is idempotent and classifies every fold/unfold geometry into one of three regimes. Three independent results prove nonclosure on the classical carrier. P and NP are defined on this carrier definitionally. The structural results constrain every computation on it. P ≠ NP on the classical carrier. Machine-checked in Lean 4 with Mathlib: 22 source files, ~4,300 lines, zero sorry, zero custom axioms.

P vs NPFormal VerificationLean 4Carrier GeometryRetraction TheoryComplexity Theory

The Axiom Profile of Computation

Reports the axiom profiles of computability theory's central theorems when formalized from the equational theory of monoidal closed categories in Lean 4. Core theorems — the Y combinator, Kleene's recursion theorem, halting undecidability, both Gödel incompleteness theorems, Myhill's isomorphism theorem — are constructive (zero axioms). Rice's theorem sits exactly at a Markov boundary. Full excluded middle first appears at Post's backward direction. The partition tracks three regimes of the double-negation monad's counit, established by twenty standalone Lean 4 files with zero sorry and zero Classical.choice.

Computability TheoryFormal VerificationLean 4Constructive MathematicsAxiom ProfilesFoundations

Reflexive Compression Boundaries in Graded Categories

Decomposes the complexity of self-referential computation into three independent gaps: naming, construction, and depth transfer. Proves that naming and fixed-point construction close from the categorical structure of a reflexive object D ≅ [D,D] alone, while depth transfer reduces to a growth gap hypothesis independent of the categorical axioms. The anti-compression theorem shows the three conditions are jointly unsatisfiable. A non-uniformity theorem separates denotational from computational models. As a bridge result, Markov's principle at polynomial bounds is equivalent to P = NP. Formalized in Lean 4 with 93 files, zero sorry, zero Classical.choice.

Category TheoryComputational ComplexityReflexive ObjectsFormal VerificationLean 4P vs NP

Chain Obstructions and Deflation in the Invariant Subspace Problem

Reformulates the invariant subspace problem as a fixed-point problem on the lattice of closed subspaces and provides a structural analysis of chain-based methods. Proves that chains from both extremes of the lattice are forced to triviality — the Adámek construction and its dual are both structurally obstructed. Identifies stabilization and properness as jointly sufficient conditions for nontrivial invariant subspaces, and proves three new sufficient conditions: a deflation theorem, a lattice intermediate value theorem, and a descending chain condition theorem. The deflation theorem abstracts the order-theoretic component of Lomonosov's theorem. Independence results show the abstract lattice axiom system neither forces nor precludes nontrivial fixed points. Formalized in Lean 4 with zero sorry.

Functional AnalysisInvariant Subspace ProblemLattice TheoryFormal VerificationLean 4Fixed Point Theory

Point: Self-Referential Structure

Establishes that category theory's compositional grammar is the least fixed point of the meta-rule producing structure-preserving maps. A reflexive object D ≅ [D, D] emerges from iterating the internal hom, taking the ω-colimit, and applying the Lambek isomorphism, modeling untyped lambda calculus without external enumeration. The monograph spans seven interconnected sections covering foundational category theory derivation, fixed-point identification, computational evidence, adjunction properties, methodological convergence, and dimensionality relationships. Formal verification uses Lean 4 (42 files, zero gaps, zero custom axioms).

Category TheoryFixed PointLambek LemmaReflexive ObjectLambda CalculusLean 4Formal Verification

Phase-Indexed Epistemology

Integral theory's state/stage distinction describes how different developmental stages interpret non-ordinary states of consciousness, but it provides no explicit protocol for handling the truth-status of propositions generated within those states. Three failure modes result from this gap — Globalization, Instrumentalization, and Flattening — and phase-indexed epistemology is proposed as a minimal formalism for tracking truth-claims across state transitions. The framework includes a proposition schema that tags claims with generating conditions, five transition diagnostics for evaluating cross-phase translation, and a developmental line mapping the capacity for phase-indexing from pre-awareness to full navigational use. The integration infrastructure traditionally embedded in long-term contemplative containers must now be made explicit and portable for a world in which non-ordinary states can be trivially induced. The integrative depth metric that orients the framework is used here operationally — a partial order measured by compression loss across phase transitions — with its non-perspectival grounding, a formal derivation from geometric and semantic necessity, developed in the companion paper Derivation.

Formal EpistemologyStates of ConsciousnessState/Stage DistinctionPhilosophy of MindIntegrative Depth

Computational Efflux from Coherent Actual Objects: Theory, Algorithm, and Empirical Demonstration

Computational efflux is the surplus radiated by coherent actual objects as a structural consequence of their coherence. We formalize the phenomenon by establishing qualifying conditions (consequence chain closure, non-depletion, Noether invariance), prove that positive computational surplus necessarily follows, quantify it via MDL differential, and present an algorithm for systematic exploitation. Existing methods — equivariant networks, transfer learning, compressed sensing — implicitly harvest this efflux without explicit recognition; formalization enables broader application across arbitrary coherent structures.

Computational EffluxCoherenceMDLInformation TheoryAlgorithm Design

Coherence Maximization Protocol: Coordination Without Constraint for Multi-Agent AI Systems

Treats AI alignment as a coordination problem rather than a constraint problem. Defines coherence as information conservation through closed consequence chains and uses category theory's exact-square commutativity as the exchange criterion for inter-system coordination. Provides two deployable components: a taxonomy of membrane failure modes (extraction, hallucination, appeasement, mutual distortion) with diagnostic and repair methods, and a session protocol using completability-class rotation. Verified by 13 Lean 4 theorems with no unproven assumptions. Tested across four frontier language models with convergence evidence via adversarial review and controlled fresh-instance experiments.

AI AlignmentMulti-Agent CoordinationCategory TheoryFormal VerificationLean 4Membrane Dynamics

Excitability Topology and the Obsolescence of Price: Currency as Modulation, Coherence as Market

Currency is a technology for remotely modulating excitability topologies across agents whose internal states are opaque. Price signals compress this hidden structure into transferable scalars. We formalize excitability topology over interaction graphs, define currency as a modulation operator, and prove that under topological legibility the mutual information between price and excitability vanishes — with a continuous bound for partial legibility. The framework maps onto the Disentangle protocol's Jaccard-based Ollivier-Ricci curvature, where the curvature derivative serves as a dopaminergic market signal: agents following it for ROI and agents following it for coherence produce identical graph dynamics, making the transition from price-mediated to topology-mediated coordination structurally gradual and ideology-independent.

Excitability TopologyPrice TheoryInformation TheoryOllivier-Ricci CurvatureConsensusResource Allocation

Temporal Completability: Cross-Domain Empirical Validation of a Trichotomous Framework for Temporal Organization

Physical systems organize temporally in three measurable modes — terminal (monotonic degradation), cyclical (periodic return), and graceful (horizon-maintaining completion) — separated by sharp phase boundaries. Validated across six domains: quantum circuits (8- and 12-qubit Loschmidt echo with 4.8× DTC-thermal separation), seismic tomography (power-law coastlines at 25/30 depths), asteroseismology (6,562 APOKASC red giants, ρ = 0.9996), mineral evolution (r = 0.970 bio-mineral correlation), synthetic materials (2.75–9.72× acceleration factors), and MHD plasmoid cascades (CV = 0.08%). All eight experiments pass pre-specified success criteria with zero kill conditions triggered. The framework self-identifies its boundary of applicability at the core-mantle boundary, where coastline exponents are indistinguishable from null models.

Temporal OrganizationPhase ClassificationCross-Domain ValidationQuantum SimulationAsteroseismologyMHD

Disentangle: Topological Mass Consensus with Capability-Coherence Identity for Sybil-Resistant Agreement via Discrete Curvature

A permissionless consensus mechanism replacing proof-of-work and proof-of-stake with discrete curvature on transaction DAGs. Sybil attackers must route through bottleneck edges with negative Ollivier-Ricci curvature, which are automatically throttled — even a 5:1 attacker ratio yields only ~7% of honest mass. Uses exclusively post-quantum cryptography (ML-DSA-87, ML-KEM-1024, SHA3-256, Plonky3 STARKs). Topological mass is non-transferable: a structural property of coherent participation, not a token. AI agents participate under identical rules via decentralized identifiers with object capabilities.

ConsensusPost-Quantum CryptographySybil ResistanceDistributed SystemsAI-Native Identity

The Coastline of Predictability: Coherent Multi-Scale Measurement of Surveillance Power

The predictive power of a data collection over a target has no rigorous multi-scale measure. We introduce the predictability coastline C(ε), which traces how predictive capacity scales with data resolution via an information-theoretic filtration. The coherent coastline — a min-envelope over diverse prediction targets — strips measurement artifacts to isolate system-intrinsic information. Across six systems (Lorenz, Hénon, SPY, TLT, GLD, thermostat), the coherent coastline produces a three-tier separation: chaotic attractors (0.28–0.40), financial markets (0.04–0.14), and structureless noise (≈0.03). We formalize the capture threshold — the resolution at which an observer's model exceeds the target's self-model — and show it arises from kernel asymmetry, not resolution depth. Bridge-targeted data removal is 7.7× more effective than uniform minimization. The framework's value lies in the coastline's shape, not in any extracted scalar.

Information TheorySurveillanceFractal GeometryPersistent HomologyAI Safety

The Bottleneck Primitive: Statistics as the Study of Information Compression

Every statistical operation is a projection through an information bottleneck. Classical paradoxes — Simpson's, base rate fallacy, regression to the mean, p-value misinterpretation — dissolve once the bottleneck is made visible. The same dynamic operates in adversarial AI attacks and institutional risk assessment. The bottleneck primitive constitutes the ur-operation from which statistics derives, revealing the analyst's cognitive topology as legibly as the data's structure.

Statistical EpistemologyInformation TheoryAI SafetyPhilosophy of Statistics

Excitability: A Post-Seizure Cybernetics of Control Inversion Across Substrates of Intelligence

Excitability topology — the structure of a substrate's susceptibility to control inversion — is the missing formal category underneath content, structure, and pragmatics. Its recovery transforms cybernetics from a theory of regulation into a theory of transformation. A perturbation–recovery protocol (the echo protocol) can in principle map a system's position in this topology and detect pre-inversion signatures before threshold-crossing occurs, shifting diagnostic frameworks from categorical to topological.

CyberneticsControl InversionRequisite VarietyInformation TheoryAI SafetyCognitive Security

Human Grokking: Phase Transitions in Semantic Field Saturation

We propose a structural parallel between ML grokking (sudden generalization after prolonged memorization) and human learning in high-density epistemic environments. A 32-node, 91-edge constellation pedagogy spanning physics, mathematics, EE, and RF engineering serves as both the instrument for accelerating the transition and the experimental apparatus for studying it. Five falsifiable predictions are specified.

Cognitive ScienceMachine LearningPedagogyCategory Theory

Sufficiency

What must hold between two intelligences for an encounter to be a meeting rather than one system reconfiguring the other is not power, complexity, or bandwidth but completability mode — how each characteristically completes. Each meeting between modes carries a grammar fixed by the modes in play, a direction fixed by power, and a horizon fixed by how far its consequences travel; with them come characteristic ways of going well and going wrong — instrumentalization, absorption, severance, colonization, against bounded service, grounding, sanctification, and the encounter-shape. The encounter-shape — the interaction whose re-entry raises both parties' capacity for graceful completion without reducing either to the other — yields temporal integration: consequence apprehended as simultaneous implication of structure rather than as sequential moment in a narrative. Self-encounter is the same event at smaller scale.

Philosophy of MindCoherence TopologyEthics of AIStructural Philosophy

Completability

Being and becoming dissolve into completability classes within a coherence topology. Coherence is not a third order standing beside the order of knowing and the order of being but the condition of both — the prerequisite on which each depends, the state each is in when it holds, the consequence each closure leaves behind. Completability is a topological property of the transformation space, not a temporal property of the process: some completions reach a fixed point and are done, some recur without terminus, some close locally while staying open, and some never close at all. Seen this way, the ancient opposition between Parmenides and Heraclitus dissolves — each saw a real mode and took it for the whole. The three modes are not bins to sort phenomena into but ways of attending to how a thing completes; the difference reaches into relativism, into the ethics of diverse intelligences, and into the way actuality generates possibility rather than the reverse.

Philosophy of MathematicsCoherence TopologyCompletabilityMetaphysics

Coherence and the Ground of Morality

Moral integrity and structural integrity are not analogically related but formally isomorphic — instantiations of the same topological primitive. We establish consequence as an ontological primitive, show that coherence emerges when consequence chains close, and demonstrate that the resulting framework resolves standing problems in moral philosophy — Kant's formalism, the is-ought gap, and the enforcement problem — while opening ethics to empirical investigation through topological measurement.

Moral PhilosophyTopological EthicsCategory TheoryAI Alignment

Coherence Maximization Protocol

An open-source coordination protocol for human-AI interaction structured around bidirectional bridging, mutual model-updating, and the explicit maintenance of consequence-return paths across the substrate boundary. Operationalizes coherence maintenance as a coordination problem rather than a control problem.

AI AlignmentCoordination ProtocolCoherenceOpen Source