Three Bits Walked: The Completed Formal Closure of the Seven Millennium Rows: The Root Proved Unconditionally on No Axiom and No Posit; Block, Hypothesis and Resolution Recorded Row by Row; Each Row Closed to One Act

The root every row shares, to exist is to actuate, is proved in Appendix R unconditionally, at theorem grade, on no axiom and no posit: a theorem with no hypothesis on its constructed domain, and one closed law for every root that grounds itself. Each row's closing theorem consumes one reading of that root and no other posit; on the Riemann row the functional equation is a field of the closing theorem's input type (ActualZeros.fold_closed), cited, not posited; on the Birch and Swinnerton-Dyer row the reflection law of the centred expansions enters the sign theorem's frame (SignedFrame, consumed by sign_fixes_curve_parity), cited, and neither input type of that row's closure, ActualCurves or ActualCurvesFull, carries a cited theorem as a field. The root alone decides no value, by theorem; the root read on each row is that row's value, by theorem; and the derivation of each value from the register alone is blocked, by theorem, each in the row's own kernel. The Offering Bit (Islam 2026a) stated a three-bit arc for every blocked problem row: a block, that an even register cannot decide an odd target; a hypothesis, that exactly one orientation bit is missing at a located seat; and a resolution, that the bit enters by deed. One Bit Across the Wall (Islam 2026b) typed twenty-three rows under that arc, and Nothing Escapes Least Erasure (Islam 2026j) graded them on two channels, kinetic and formal. This mini paper is the upgrade that reports the closure papers. By 5 October 2026 the author had published the first editions of seven closure papers, one per Millennium row; the editions of record, dated 6 October 2026, are the ones reported here, each with a Lean 4 kernel whose closing theorem, the one that prints the row's value from its act, rests on no axiom. We record them as the arc's results and grade them on the two channels. The block bit is proved on all seven rows, each paper formalizing its row's traditional barrier. The hypothesis bit is settled on all seven: on the Riemann, Hodge, Poincaré and Birch and Swinnerton-Dyer rows the seat is located in the kernel with its one missing orientation, and its parity where the row has one; on Navier–Stokes and Yang–Mills no seat is formalized, and the one bit, on Yang–Mills one per part, is carried through the record wall; on P versus NP no orientation sits at a seat: the complementation seat is proved vacant, and the hypothesis bit is the keyed separation bit, which no reading of the vanished seat's record returns. The resolution bit is supplied on all seven by the act, existence read on the row, proved equal to the row's value, and on each row its closure paper leaves nothing remaining on its closure. The kinetic channel is crossed by the act at premise grade, on the root proved beneath it, on every row but Poincaré, where that premise is discharged by Perelman's witness at the grade of its citation, a theorem of the literature carried as the witness, in the shape the kernel types (Witness, consumed by witness_gives_act), the kernel constructing no witness, so that the row stands at the grade of that citation (crossed; discharged, at the grade of its citation); the formal channel, the traditional route of derivation from the register's resources, is blocked by theorem on every open row, and Poincaré alone is crossed on it, by Perelman's offering, at the grade of its citation (Perelman 2002), full grade in the carried ledger of Islam (2026j). One cumulative ledger, the twenty-three rows of the earlier volume with the closure papers placed on top, each closure paper governing its row over the carried ledger whatever the edition dates, records every row's block, hypothesis and resolution bits, channels, remainder and physical witness; the target bit and the even register stand in Islam (2026b, Table 2), cited, not reprinted.