Note G, 1843

THESIS Main (won): Ada Lovelace's Note G (1843, in her translation of Menabrea's paper) was a full program for Babbage's Analytical Engine, computing Bernoulli numbers through her recurrence 0 = A₀ + A₁B₁ + A₃B₃ + …, in her odd-index numbering, so her B₇ is the modern B₈. Ghost: the table as printed, which carries two bugs (LIT: Wikipedia "Note G", Enigmatic Code 2015, Nyagumbo). Operation 4 divides V₅/V₄ instead of V₄/V₅, and operation 24 adds instead of subtracting. COMPUTEDThe page runs it with exact BigInt fractions. Correct: 1/6, −1/30, 1/42, −1/30. With the op-4 bug from the start, B₇ = −25621/630 (Wikipedia's figure). With both bugs on the last pass only, it gives −139/630 (Nyagumbo's figure). With op 24 alone, +1/30. This reconciles the two published "buggy" values: they model different scopes of the bug.

MNEMONIC "Four flipped, twenty-four signed: minus one-thirtieth."

mode: correct

+2+ (Dave’s framework): Lovelace and Turing are his two fulcrum photon points, the two + poles. Main track = the idea that won; ghost track = the challenger that lost. Entangled partner: lovelace-objection.

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