Lnal Vm Eight Beat Alignment Invariant

The eight-beat invariant

The eight-beat invariant is a formal statement about a small, precisely defined virtual machine. The machine runs a fixed program made by repeating the same two-instruction block twice, and the invariant says that certain counters inside the machine stay aligned with a repeating eight-step window. In plain terms, the machine's internal bookkeeping, its record of which window it is in and how much work it has accumulated, never drifts out of step with that eight-step rhythm.

The machine itself is a state machine: it has a current instruction pointer, a small set of registers, and a breath counter that resets after 1024 steps. The program under study, called the eight-beat program, is simply the k-gate program run twice. The trace of this program, the list of all states it passes through, is what the invariant inspects. The invariant is checked by a definition in the machine-checked library of formal theorems, and it is a definitional check, not a separate theorem, meaning the property is verified by the way the trace is constructed.

What the invariant establishes is that the trace of the eight-beat program has a specific structure. The trace is a finite list of states, and the invariant checks every consecutive pair of states in that list. For each pair, it confirms that the window index, the counter that names the current eight-step window, advances exactly as expected. It also checks that the vector sum cycle, a counter that accumulates work, increases by the value of a register called k_perp at each step. The invariant does not claim that this behavior is good, optimal, or meaningful; it only records that the machine behaves in this exact, regular way.

In Recognition Science, this invariant is a small piece of a larger story about how recognition events, discrete records of comparison, are forced into an eight-tick cycle. The framework's central result proves that any cost function satisfying five plain conditions must equal a specific form, and from that form a chain of theorems forces an eight-tick recognition cycle. The eight-beat invariant is a concrete, machine-checked instance of that cycle: a program that, by its construction, exhibits the same eight-step alignment. It is a demonstration that the abstract cycle can be realized in a simple, running system.

The invariant does not claim that the eight-beat program is the only program with this property, nor that the alignment is caused by the framework's cost function. It is a statement about one specific program on one specific machine. It does not prove that the eight-tick cycle is universal, nor that the machine's behavior is physically meaningful. The invariant is a fact about a formal object, and its significance, if any, comes from how it fits into the larger framework, not from the invariant itself.

/-- Enumerated eight-beat vector exposing window/count progression and commit flag. -/
def eightBeatVector : List (Nat × Nat × Nat × Bool) :=
  (List.zip (List.range eightBeatTrace.length) eightBeatTrace).map fun
    | (step, st) => (step, st.winIdx8, st.windowCount, st.commitPending.isSome)

/-- Hardware invariant: vector sum increments exactly by k⊥ each step. -/
def kGateIncrementInvariant : Bool :=
  (consecutivePairs kGateTrace).all fun
    | (s, s') =>
        if s'.vecSumCycle = s.vecSumCycle + s.reg6.kPerp then
          true
        else
          false

What this page does not claim

The invariant proves that the eight-beat program is the only program with this alignment property. The invariant establishes that the machine's behavior is physically meaningful or optimal. The invariant is a theorem about the framework's cost function forcing this behavior.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/LNAL/VM.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: