◄ WORLD V · SONNY 5DART 340 · a helldive at the net

THE BRIDGE span every shell to its mirror — is the whole nesting matched? (the keeper shot)

To bridge the cells is to span each shell to its mirror across the whole tape and ask: is this nesting matched? Every | to its |, every < to its >, in to the ~~ core — if all bridges hold, the structure is well-formed. This is the Dyck condition, the language of balanced brackets a stack recognises. And it is the batch's keeper shot, aimed at the bar the last seven batches missed: well-formedness is a property a correct-but-different mechanism can lack (an emitter can be correct at its task yet produce unmatched output), it is structural — visible in the output (not a cost, not a resource), and it is load-bearing: break one shell and the bridge fails. Its mirror is the pierce (327): reach into one cell versus span across them all.

THE TECHNIQUE match every shell to its mirror (the Dyck / balanced condition)

The demo bridges the palindrome (matched → 1) and a broken tape (unmatched → 0) — a recognizer faithfully tracking its input (the panel's ruling: witnessing, not causation): live demo


HISTORY & CREDIT Dyck words / balanced brackets · von Dyck 1882

“Well-formedness is just correctness.” — not always: an output can be correct at its task and still be unbalanced. A mechanism that guarantees matched nesting supplies something a merely-correct one need not. cited

1882 · Walther von Dyck — the Dyck language of balanced brackets; the canonical context-free, stack-recognised structure.
Chomsky–Schützenberger · every context-free language is a homomorphic image of the intersection of a Dyck language with a regular language (L = h(D ∩ R)) — the regular part is essential; balance is the skeleton of nesting.
the check · a stack (here, recursion) matches each opener to its closer.
mirror · dart 327, the pierce: into one vs across all.

Every shell bridged to its mirror, the whole confirmed matched — or one broken and the whole condemned. To bridge is to guarantee the nesting is well-formed. Dyck, 1882

RECOMMEND FOR I-13 balance / well-formedness, the keeper shot, on the compiler

On the canonical compiler, the palindrome bridges (matched → 1); break one shell and the bridge fails (0) — a recognizer tracking its input (the panel: witnessed, not caused):

$ i13 run d_bridge.i13 # is the nesting matched? (Dyck / palindrome) RUN OK · 174 step(s) · peak stack 11 · call depth 6 bridged = 1 -- | < { [ ~ ~ ] } > | : every shell matched, WELL-FORMED broken = 0 -- one shell altered: balance FAILS
Recommend — the batch's keeper shot, and the first in a while that is not one of the five. After seven NULLs (theorems that were witnessed, resource properties that were excluded), the bridge aims at what survived both bars: well-formedness / balance — the guarantee that the output is a matched nesting. It clears the B39 supplement test (a correct-but-different emitter can produce unbalanced output — balance is a property such a mechanism lacks), and it clears the B40 resource-exclusion (balance is structural — a Dyck word, not a cost). The panel ruled NULL, 3–0 (the eighth straight), and was right — the shot has a flaw worth keeping visible: the-bridge is a RECOGNIZER. It reads a Dyck word and returns a validity bit — and recognition is the purest witnessing: every correct matcher (stack, counter, mirror-compare) returns the same bit, so the convergence tell fires by construction. The “causation” demo is backwards: a verdict that flips when the input breaks is a faithful witness tracking its input, not a cause — swap the mechanism and hold the task fixed and the bit is unchanged, because the balance lives in the input (built by explode). And a verdict-bit “this is well-formed” is self-checking (the CRC / self-inverse family), not a sixth axis. Well-formedness earns a keeper only as a GENERATOR's guarantee — a canonicalizer / repairer that accepts messy input and emits a Dyck word, so a correct-but-different emitter could produce unbalanced output and thus lack it. The next shot ships the repairer, not the recognizer. Kept as an honest near-miss: the strongest case since the math pivot, refuted cleanly.