Repository navigation
Audit selected scatter parity across word and record checks - #2977
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
3 of 4 tasks
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 17, 2026
…ew kappa) Answers PR #3004's third open question for one full-size word. Row 0 [4,5,6,7,8] of the selected PR #589 bit word is extended four ways and each word runs through the unchanged symbolic checker, record exporter, both entry modes of PR #2992's simple-scatter-v1 guard and the native legality and five-stage column checkers. Appending [4,4] triples an existing slot: the symbolic and both native checkers accept it, and all three exporter artifacts and both native receipts equal the baseline byte for byte (27,234 records, 24,305 ADDs, rank mass 5129, nine COPY/ERASE pairs). Appending [0,0,0] triples an absent slot: symbolic and exported actions agree, but both miss the required endpoint at output 111 (98 columns; dirty input 472 is a one-bit witness), and the full symbolic and native column checkers reject it. PR #2977's paired [0,0] reproduces symbolic acceptance with native rejection. The guard rejects all three repeated rows before creating output, as its stricter schema intends. Native legality accepts all four words, so legality does not certify the endpoint. Occurrence counts are not emitted ADD counts: the accepted triple has 529 occurrences and 527 scatter ADDs. This is a finite, author-checked audit with a separately written harness. Native builds use the pinned checked 128-bit cpp_int stand-in. No schema decision, supplier adoption, cold ancestry, system-Boost build, physical hosting or kappa change is claimed. Adds research/scatter-odd-native-audit/ only. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
This was referenced Oct 18, 2026
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 20, 2026
…export boundary Answer the supplier-boundary cascade's remaining open question (PR3696 OQ1, following #2977/#2992/#3004 and scatter-parity-contract-audit): for one gate (d, srcs), the pinned symbolic checker operator (accumulate-then-write) and the pinned exporter operator (sequential per-source ADD) agree as linear maps over F2^n iff d is absent from srcs, or the destination multiplicity is odd and every register occurring before the destination's last occurrence occurs an even number of times there. Measured on 9330 (d, srcs) pairs (6 registers, source lists length 0..4, the published census domain, extended to 55986 pairs at length <= 5): destination- free 4686 all agree; destination-in 4644 split into 3492 divergent and 1152 agreeing; simulation and the independent coefficient prediction agree on 100% of pairs. Guard census: the checker's own contract and distinct-only and dest-free-only are sound with 4608 / 4602 / 1152 agreeing rejections (smallest nonempty destination-free witness [a,a]); a transplanted scatter simple-support guard is unsound, admitting 1350 divergent gates; the exact minimal guard is sound with zero over-rejections. The pinned selected tuned word has 5472 D/A/B/C gates, all with distinct nonempty operands, so every sound guard preserves its export; its 111 scatter rows are simple supports. No new kappa (selected 0.001672660197076918 unchanged); no production adoption; frozen packages unchanged. Reproduce: python3.12 -B scripts/research_package.py --package research/gate-operand-parity-contract
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 20, 2026
…he multiplicity contract Reproduces the #2977 paired-null scatter counterexample from the pinned selected bytes on an independent record route: the checker XORs per occurrence, the exporter lowers by membership, and the exact divergence class is positive even multiplicity. Sweeps multiplicities 0..6, matches the archived record-byte receipts and the 98-column witness, censuses the producer chain and the two pinned words (rows are simple), probes index types, and records the successor boundary decision. No new kappa. Package: research/scatter-boundary-decision
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Adds
research/scatter-export-parity-auditfor the revision-5supplier-boundary-auditcard. The exact selected bit-word counterexample is:scatter[0] = [4,5,6,7,8] +scatter[0] += [0,0]The full symbolic checker XORs list occurrences, so the extra pair cancels. The exporter uses membership and emits one extra ADD. Record legality accepts; the native formal-column checker rejects. This demonstrates why symbolic acceptance and record legality cannot replace the exported endpoint check.
The selected generator produces unique rows and the full supplier replay binds the original bytes. This does not invalidate the selected result. The package includes a sufficient uniqueness guard as an opt-in successor candidate, exact source pins, proof, deterministic receipts and a concrete adoption handoff. Frozen sources and selected-frontier metadata remain unchanged.
Scientific base: main
d878e1f048823de10e57e3dc58522d345a5fcd8d; refreshed compatibility against47fa55b3cd8c7cf8879206f33569bc59d637dad8. Audited inputs and guidance are unchanged. Canonical investigation and handoff.Credit eumemic's checker and PR543/555/589 lineage, DreamingOfClouds' retained bit-supplier lineage, Dylan Crow's exporter/native checkers, and Douglas Colkitt's source bindings. Substantial automated assistance is disclosed in the package; predecessor notices and licenses are retained.
Evidence
After the two-entry edit: full symbolic checking still passes all H1-H5 and four conclusion flags; exported records rise from 27,234 to 27,235. With only dirty input 472 set, target 111 incorrectly becomes one. Native legality retains mass 5,129 and nine COPY/ERASE pairs; native columns exit 2 at
local defining-decoder full formal column.cpp_intstand-in. It is not a fresh system-Boost build. Full cold supplier replay, all-size transfer and hosted CI are separate obligations; no new kappa is claimed.Merge Danger
Door: two-way
Blast Radius: isolated
Nine new files in one opt-in research package. No production adoption, source repinning or selected-frontier change.