thesis · test · mnemonic

READINGPage 11 of the Lovelace/Turing run. Each node is a page, placed on the ring that matches its severity: inner = solid, outer = weakest. Tap a node to read its note.

what works (main track)	what's weak (ghost track)
Exact: Note G's recurrence in BigInt fractions gives 1/6, −1/30, 1/42, −1/30, 5/66, −691/2730. Both published "buggy" values come out: −25621/630 with the op-4 bug throughout (Wikipedia) and −139/630 with op 4 plus op 24 on the last pass (Nyagumbo), so the bug's scope explains the disagreement. Enigma I wiring is from Crypto Museum; AAA + AAAAA gives BDZGO; the crib crack works over all 17,576 positions; keyspace 158,962,555,217,826,360,000. BB(2) = 6 steps, 4 ones. Baby's factor 131072. Turing instability shown. Last run's dates verified: bet 1997 (Hawking and Thorne vs Preskill), conceded 21 July 2004 at GR17 Dublin (APS, Preskill), page fixed; Foucault 30 April 1850 (DSB); Adams plant 26 Aug 1895 (IEEE milestone).	Note G is modelled through her recurrence, not her 25-operation table cell by cell. The Enigma has no plugboard or ring settings, so the bombe here is brute force, not Turing's menu logic. Not fetched this run: CTSS 1961, Baby 21 June 1948 and 52 min, EDSAC May 1949, Pilot ACE May 1950, Setun 1958, Kondo & Asai 1995, Babbage c.1854. Turing's 1950 prediction is paraphrased. "+2+ fulcrum photon points" is Dave's framework (MODEL).
Ten winner/ghost pages; five entangled pairs; cubit watermarks.	Next: a cell-by-cell Note G table, plugboard menus and the diagonal board.

what works (main track)

what's weak (ghost track)

Exact: Note G's recurrence in BigInt fractions gives 1/6, −1/30, 1/42, −1/30, 5/66, −691/2730. Both published "buggy" values come out: −25621/630 with the op-4 bug throughout (Wikipedia) and −139/630 with op 4 plus op 24 on the last pass (Nyagumbo), so the bug's scope explains the disagreement. Enigma I wiring is from Crypto Museum; AAA + AAAAA gives BDZGO; the crib crack works over all 17,576 positions; keyspace 158,962,555,217,826,360,000. BB(2) = 6 steps, 4 ones. Baby's factor 131072. Turing instability shown. Last run's dates verified: bet 1997 (Hawking and Thorne vs Preskill), conceded 21 July 2004 at GR17 Dublin (APS, Preskill), page fixed; Foucault 30 April 1850 (DSB); Adams plant 26 Aug 1895 (IEEE milestone).

Note G is modelled through her recurrence, not her 25-operation table cell by cell. The Enigma has no plugboard or ring settings, so the bombe here is brute force, not Turing's menu logic. Not fetched this run: CTSS 1961, Baby 21 June 1948 and 52 min, EDSAC May 1949, Pilot ACE May 1950, Setun 1958, Kondo & Asai 1995, Babbage c.1854. Turing's 1950 prediction is paraphrased. "+2+ fulcrum photon points" is Dave's framework (MODEL).

Ten winner/ghost pages; five entangled pairs; cubit watermarks.

Next: a cell-by-cell Note G table, plugboard menus and the diagonal board.

READINGNext time: Note G cell by cell; a real bombe menu.

DURABLEANCHOR LEDGER · Dave's kernel, running in this page

provisioning…

self-checks (kernel, then page)

Engine: Dave's DurableAnchor kernel, ported faithfully to the browser with Web Crypto SHA-256 and an in-memory record store (exclusive-create, so concurrent reservations are refused; fsync has nothing to flush). The ledger starts empty on each load. Every state change on this page is a reservation (id, epoch, sha256 of the state), and the head shown above chains them all from sha256('ROOT0:P369:GENESIS'). Persona: {{+L.-E.+O. D++}} (Dave's notation). Built by Grok Bot · seed · ← SaPpH{{i}}on