Repository navigation
Research: audit native acceptance of odd scatter multiplicities (no new kappa) - #3210
Open
commdata2338 wants to merge 1 commit into
Open
commdata2338 wants to merge 1 commit into
commdata2338 wants to merge 1 commit into
Conversation
…ew kappa) Answers PR CrocSwap#3004's third open question for one full-size word. Row 0 [4,5,6,7,8] of the selected PR CrocSwap#589 bit word is extended four ways and each word runs through the unchanged symbolic checker, record exporter, both entry modes of PR CrocSwap#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 CrocSwap#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 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
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.
Change and mathematical scope
This answers PR #3004's open next question 3 for one explicit full-size word, the selected PR #589 word. Appending
[4,4]to row 0[4,5,6,7,8]triples an existing slot: the complete symbolic checker and both actual native checkers accept it, and all three exporter artifacts equal the selected baseline byte for byte. Both modes of PR #2992's simple-support guard reject it intentionally. Appending[0,0,0]instead introduces an absent slot: symbolic and exported actions agree but both fail the defining endpoint. PR #2977's paired-absent[0,0]reproduces symbolic acceptance with native rejection.This is a finite source-bound boundary audit, with a separately written harness and an elementary explanation of the two odd cases. No new parity characterization, supplier admission, physical cost improvement or kappa is claimed. The four synthetic fixtures keep the nine distinct retained helpers and every other word field fixed. Frozen predecessors and the selected result are unchanged.
[0,0][4,4][0,0,0]Native rank mass stays 5129, with nine COPY/ERASE pairs. The accepted triple has the baseline's 27,234 records and 24,305 total ADDs. Both bad streams have 27,235 records and the same 98-column discrepancy at output 111; dirty input column 472 is a one-bit witness. A textual occurrence count is not the emitted ADD count.
Task and overlap
Base and final refreshed canonical main:
463113d675af7410ac91d53a4fed51ec6494eb9a; priority revision 6, refresh 2026-10-17T17:39:11.388698+00:00, no changed files. Contribution head:246c7ae12f3f103b05ed80fad0e2a9edde01c3f8.Task card:
research/scatter-odd-native-audit/TASK.json.supplier-boundary-audit/adversarial-audit.dcdb0fa8e49b08a958d0; refinementPR3004/odd-existing-versus-absent/native-boundary/four-fixtures.57515e846d560ce80ae4dbd8af60d3af. The empty catalogueexisting_checkslist was treated as unknown; actual successor coverage was inspected.research/scatter-odd-native-audit/; reproduction below.Canonical claim in discussion #2976, following the #1166 handoff.
Exact predecessor/context heads:
cd23d242dfe0e7a71cafba0ad5590dc4f2fbf4f2: discovered the mismatch and ran baseline/paired/single-absent native controls.b31bf0360ad702b1be71dea7a33edc11711084af: actual two-mode guard, no native run in that package.ce08d19f6e43bbc6f552858d93154efe3aa98916: scalar agreement/count audit; odd native question left open.80b7b0b452de3c9fa4306f49d12e904a40cfbe2e: extracted scalar-action corroboration.2bf13e5b55f8318ae74a8f17db36a19447ba8c7f: alias independence correction; this work keepsretinjective and unchanged.a5afc8c6169ea61ba7c51dfd3cade02cc7b13b46: originalresearch/e8-bit-p111/word/checker bytes equal the retainedresearch/e8-bit-p111-tuned/paths.Offline overlap queries covered the card,
odd-multiplicity,simple-scatter,native scatterandscatter-odd-native. Latest complete snapshots: 251 open PRs at 2026-10-17T17:37:12.534077+00:00; 2,015 discussion records at 17:39:04.580509+00:00. Retained main archives and the canonical thread were inspected. A closing scan of the complete snapshots at 17:49:11Z (253 open PRs) and 17:52:04Z (2,017 Discussion records) found only this claim and PR #3004's finding for this object. This is metadata/local-package coverage, not a claim to cover arbitrary diffs or unpublished work.Validation
Observed locally (CPython 3.12.3, Ubuntu GCC 13.3.0, Linux):
The registered primary replay (about 10 s) and all seven behavioral groups pass; the explicit native replay takes about 15 s. Compiles are serial and use the source-pinned checked-128-bit cpp_int stand-in, with a backend-selection probe. This is not a fresh system-Boost build.
Controls: exact one-bit dirty witness; all 64 assignments of a separate six-register scalar fixture; malformed COPY/ERASE lifetimes; every live input corrupted in turn; occupied output preservation; separate check-only and export-only validator bypass mutants; occupied receipt refusal; omitted scatter ADD and truncated native stream. The two native bad-word rejections produce no success receipts.
Publication byte check passed for all 22 package/input files. The exact commit was exported with
scripts/export_research_package.py, checked, and extracted into a read-only Git-free tree. Optimized native replay (14.729 s) and all seven behavioral groups (2.376 s) passed there; all 23 files including the export manifest remained byte-identical. Full native receipts are retained inNATIVE.json; only verified elapsed times and a temporary stream path are normalized.RESULT.jsonretains all scalar discrepancies and exporter hashes.Not checked: full selected cold ancestry; a new generator/tuner replay; native system-Boost or second-compiler reproduction; physical hosting/projector/bank realization; all-size/compiler, precision/tape and analytic transfer; supplier adoption; hosted CI; independent human or proof-kernel review. Native replay is explicit (
--native) and is not silently included in the standard-library registered hook.Credit
Nick Petalas (#2977) retains discovery, counterexample, dirty-witness, candidate-guard and earlier native-control credit. Arham Tahir (#2992) supplied the operational guard. Hiroki Kumazaki / Kumagi (#3004) supplied the contract/count audit and this handoff. James Reed / jwr404 (#3099) supplied duplicate-boundary corroboration; Sricharan Vagvala / theon199 (#3128) supplied the retained-alias premise correction. eumemic and DreamingOfClouds retain the PR #543/#555/#589 word/checker lineage; Dylan Crow wrote the exporter and the NCOPY generalization of the PR #346/#352 native cohort checkers (LJH-217, DaysSky); Sagar Thakrar supplied the checked cpp_int stand-in; Douglas Colkitt supplied selected bindings and review. All original notices and Apache-2.0 licensing remain intact.
Prepared for commdata2338 (@commdata2338), with substantial OpenAI Codex assistance.
AI assistance: submitted by @commdata2338 with substantial AI assistance. OpenAI Codex (GPT-6 Astra) did the derivation, the implementation, the checking and the writing; it was packaged and submitted with Claude Code. No independent human review is claimed.
Open next questions
The package README and TASK.json retain the actual decision: should a separately versioned successor retain simple supports, or admit multiplicity while binding emitted ADD counts and retained-slot semantics? Start with this four-fixture table and PR #3128's alias premise. Maintainer source-binding/admission review and complete supplier obligations remain blockers. No further local search is justified by this result alone.
Workflow feedback (optional)
The explicit PR #3004 open question made the useful contribution clear. The central card's
existing_checksis empty despite retained #2992/#3004/#3099/#3128 follow-ups; adding those coverage pointers would reduce repeated rediscovery without treating archival intake as scientific admission.🤖 Generated with Claude Code
https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG