Horos Engineering · proof of code · finite cognition

Try to get something past the governor

The element of the finite cognition rail — what it is built from, what is gated, and the three records it stands on.

The other two elements let you run a detector over a plant. This rail has no plant. What it has is a governance stack that runs every day — a gate on every act and a second gate on everything that reaches durable memory. So this element does the honest thing and invites you to attack it: compose a commit, and see whether it gets through.

Fail-closed ladder, four gates, evaluated in order. The default under uncertainty is closed. Nothing here is a simulation of the governor — it is the same decision procedure the harness runs before anything is written, transcribed into this page.

The ladder #

Source provenance

Provenance token 24 chars

Parity residue, mod 19 0

Information across the boundary

Reversibility

State

verdict

—

The ladder stops at the first refusal — a gate below a closed gate is never reached, which is what fail-closed means in practice. Admitting is harder than refusing, by construction. Of the — reachable commits you can compose here, — are admitted and — are refused or held.

The other gate: 81 hash declarations, checked here #

Each of the nine published records names its eight sisters by SHA-256, and its own pre-freeze hash, under a declared convention: the value is the hash of that sister's source with its own freeze block removed. That makes the web checkable rather than circular. Nine self-declarations and seventy-two cross-declarations.

The nine sources are served from this site, and nothing below is checked until you press the button. This page does not carry the nine hashes. Press it and your browser fetches each record's LaTeX source, strips the text between its two freeze markers, hashes what remains with SHA-256, and compares all 81 declarations against those values. If a fetch fails, the page says so and states no verdict.

record	declares	agreeing	hash recomputed in your browser

—

declarations agreeing

—

records

Verify it on your own copy. Paste any of the nine records' LaTeX source below. This page will strip the text between the two freeze markers, hash what remains with SHA-256 in your browser, and tell you which record it is — or that it matches none.

—

What the checks cost, including where they failed #

suite	defect classes injected	caught
front-page draft	16	16
occupancy tables	11	11
machine tables	10	10
build specification	14	14
visual	10	10
skeleton	9	9

Those numbers are only worth reading because of the next paragraph.

Four checks in this estate passed and were wrong, and each was found by adversarial replay rather than by the check itself. A law was gutted while keeping its number — the guard verified the label existed, not the sentence. A claim was verified for presence rather than truth — the page asserted something the numbers three inches above it contradicted. A suite reported “no findings” over zero records, returning the same verdict and the same exit code as one that examined everything. And a guard asserted more than its source, failing on correct behaviour. All four are fixed, all four are in the register, and none of them was found by the thing that was supposed to find them.

That is the argument for the replay, and it is the reason this rail's proof is an invitation to attack rather than a table of green ticks.

What this is not #

This rail has no telemetry reader and no plant. There is no operating system being observed here. What runs is governance: a gate on acts, a gate on saves, provenance-checked memory, and an append-only account.

The loop closes through a person. No unit orchestrates. The architect reads what a kernel would read — the work done and the state banked — and sequences from it. That seat is occupied, not automated, and the record says so.

Advisory-only, like the other two. The governor's authority is over what may leave the layer and what may persist. It has no authority over anything else.

Gates: provenance (admit, never fabricate) · parity and conservation · reversibility (append-only) · settled, not mid-flight. Freeze convention declared in all nine records; hashes recomputed in this page with SHA-256 via the Web Crypto API.