208⁻¹

MATCH(exact) Inversion 4 has a catch. Flipping every sign (a+b− → −a−b+ …) does not change which letters cancel: the evens still cancel, the odds survive with negated coefficients, and the value is −356 per pass (−2848). To make the odds cancel and the evens survive, the pairing has to shift by one letter (the parity inversion). Then:

• The 13 odd letters cancel and the 13 even letters survive.
• The survivors all move to the LEFT hemisphere (odd ranks) and the cancelled cells to the RIGHT: 104 / 104, swapped.
• Plain even sum: 2 + 4 + … + 26 = 182 per pass × 8 = 1456.
• Carrying the original coefficients (×1, ×2 …, ×3 at the break) to the shifted letters gives 356 + 26 = 382 per pass × 8 = 3056.

MATCHInversion 5, backwards: reading z→a (lines reversed) leaves the sum at 356, because addition commutes. With alphabet values inverted (a = 26 … z = 1), the value is 27·26 − 356 = 346 per pass (2768).

MODELThe letter-to-cell mapping is Dave’s framework; these are not decipherments.

modevalues: a=1

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