Mister-Meeseeks · Oct 13, 2026 · Oct 13, 2026
diff --git a/research/bit-compression-provenance/CLAIM.md b/research/bit-compression-provenance/CLAIM.md
@@ -0,0 +1,48 @@
+# Sprint claim
+
+- Track: research consolidation; OS-random assignment seed **99**.
+- Exact base: `007664306fff84fbb1c9a1b4053b69f439764034`.
+- Object: the historical `certificates/bit-compression-audit.json` scoped
+  paired-template obstruction and its incomplete two-file source inventory.
+- Method: reconstruct and pin the repository-local import/input closure;
+  replay the unchanged producer and compare all mathematical fields; test
+  altered-driver/helper/certificate controls; independently check the exact
+  role-budget arithmetic. No expansion of the old search domain.
+- Deliverable: one additive research consolidation package, reproducible
+  verifier, source and result receipts, and a scoped provenance explanation.
+- Expected finish: 2026-10-13 08:40 America/Los_Angeles (15:40 UTC), reserving
+  at least the final quarter of the 45-minute budget for review and handoff.
+- Candidates considered: (0) bit-compression provenance closure, (1) stage-pair
+  fusion evidence closure, (2) balanced-Fano completion lineage. Seed 99 mod 3
+  selects candidate 0. The other historical packages have related pending
+  replay tooling (#824 and #756); no same-scope bit-compression closure was
+  found in the focused public search.
+- Coordination: no pinned sprint issue was visible in the public issue list
+  (open issues #913 and #650). Claim recorded locally as requested.
+- Overlap checked with Curiosity Bot's GitHub provider: latest 100 open PRs;
+  provenance and negative-result queries (each capped at 100); focused Fano,
+  stage-pair and bit-compression queries. These are bounded searches, not a
+  claim to have reviewed every open PR. Latest inspected arrival was #961.
+- Attribution: contributed by woklerx with substantial OpenAI Codex assistance;
+  predecessor mathematical work remains credited to its original authors.
+
+## Completion update
+
+The full isolated replay reproduced every historical certificate field. The
+new inventory binds 32 inputs, including all nine local Python sources. The
+independent checker confirms all 73 local, 18 global, and 36 finite paired rows;
+no arithmetic discrepancy or new kappa was found. The concrete deficit-formula
+mutation changes an exact ratio while preserving both old source hashes, and
+is rejected by the new input binding. All 23 regression tests pass normally
+and under `-O`; all seven predecessor tests pass. Final receipts are retained
+in `REPLAY.json` and `VALIDATION.json`.
+
+Final public overlap refresh on 2026-10-13 at 08:14 America/Los_Angeles
+included the latest 100 updated open PRs through #966 and the focused
+bit-compression query (only unrelated #289). No same-scope result was found.
+PR867's selected-799 provenance map, PR756's Fano replay, PR824's stage-pair
+replay, and PR946's broader cross-platform work concern distinct inputs or
+obligations. There is still no pinned sprint issue; open issues are #913/#650.
+
+Contribution handoff: [source branch and complete package](https://github.com/woklerx/integer-mult-bounds/tree/research/bit-compression-provenance-seed99/research/bit-compression-provenance).
+The single PR URL is also recorded in the local submission handoff.
diff --git a/research/bit-compression-provenance/README.md b/research/bit-compression-provenance/README.md
@@ -0,0 +1,144 @@
+# Historical bit-compression provenance closure (no new kappa)
+
+The historical [bit-compression certificate](../../certificates/bit-compression-audit.json)
+has two `source_sha256` entries. Both still match at base
+`007664306fff84fbb1c9a1b4053b69f439764034`, but they do not pin the full computation:
+the driver and eight helper modules execute, and only one of those nine Python
+files appears in that inventory. In particular, the omitted
+`shared_point_network.counts` computes the deficit used in the saving bounds.
+The upstream manifest that determines `upstream_commit` is also omitted.
+
+This package resolves that **provenance undercoverage**, not a mathematical
+counterexample. It supplies a checked local source/input closure, a fresh replay
+that compares every certificate field, an independent arithmetic checker, and
+failure controls. The full replay reproduced the historical result. No existing
+construction, certificate, selected frontier, or `upstream/` file is changed.
+
+A concrete control changes only the omitted helper's `D=N-2*L` to `D=N-2*L+1`.
+At the recorded winning counts, the deficit ratio changes from `23/660995000`
+to `1767136000001/50785567840000000000`, an exact difference of
+`1/50785567840000000000`. Both historical source hashes still match; the new
+input verifier rejects the changed helper before execution. This demonstrates
+why those two hashes alone do not bind the arithmetic-producing code.
+
+## Reproduce
+
+From the repository root, with Python 3.11 or later and no third-party packages:
+
+```sh
+python -I -S -B research/bit-compression-provenance/verify.py
+```
+
+Expected final line:
+
+```text
+PASS: 32 pinned inputs; 9 local Python files; no new kappa.
+```
+
+This checks hashes before executing any predecessor code, checks the independent
+arithmetic, and runs the unchanged historical producer in a fresh temporary
+directory. The reference output is removed from that directory before execution,
+so an omitted producer write cannot count as a successful replay. Only pinned
+files are copied. An ambient `PYTHONPATH`, site package, or added package
+initializer cannot enter this isolated source copy. A runtime module inventory
+must agree with the static import closure. Every generated JSON field must match;
+only JSON key order and whitespace are normalized. Integer `1` and Boolean `true`
+are different. The original two source hashes are retained in the comparison.
+
+To write a receipt, add `--output /path/to/a/new/receipt.json`. An existing receipt
+is refused. `--check-only` is a quick input/arithmetic check and explicitly reports
+`INPUTS_AND_ARITHMETIC_ONLY`; it does **not** report a fresh producer replay.
+The wrapper rejects `-O` because the predecessor's circuit checks use assertions.
+
+Run the failure controls and the original focused tests separately:
+
+```sh
+python -I -S -B research/bit-compression-provenance/test_verify.py
+python -B -m unittest discover -s tests -p test_bit_compression.py -v
+```
+
+The first command tests this package's source, arithmetic, output-comparison,
+and isolated-replay failure modes. The second is the predecessor's seven-test
+suite. The contribution does not change shared modules, so global artifact
+regeneration and the selected-frontier cold replay are unnecessary here.
+
+## What the new inventory establishes
+
+[SOURCES.json](SOURCES.json) records exact SHA-256 values for 32 inputs:
+
+| Input class | Count | Purpose |
+| --- | ---: | --- |
+| Historical driver and repository-local imported Python modules | 9 | Actual producer implementation, including function-local imports |
+| Historical proof note | 1 | Written model, counting argument, and infinite-tail hypotheses |
+| Upstream manifest and its listed files | 20 | Bind the manifest itself and every file read by `verify_sources` |
+| Historical output certificate | 1 | Exact expected result, independently retained for comparison |
+| Historical focused test module | 1 | Reproducible predecessor test source |
+
+The upstream dependency remains OpenAI's `math` commit
+`adc7f1241b42e322a6451854ab7e4b4c146bf78a`. The static graph has nine local Python
+files; the runtime trace contains the eight imported helpers plus the separately
+executed driver. Unknown non-standard-library imports are rejected, including a
+helper omitted from both the files table and the graph. All inputs are verified
+again against the copied bytes as applicable, and non-output files must remain
+unchanged after execution.
+
+These hashes are integrity bindings relative to the reviewed Git source. They
+are not signatures or proof that a run occurred. The Python interpreter and its
+standard library are recorded as environment, not pinned binary dependencies.
+The closure is for this producer, not a claim to discover arbitrary dynamic
+imports or authenticate the repository's entire dependency graph.
+
+## Mathematical evidence and boundary
+
+The independent checker imports no predecessor implementation. It reconstructs
+the rational logarithm enclosures, count formulas, strict integer role budgets,
+candidate domains, and best/peak selection. It checks:
+
+- All 73 distinct local configurations at `h=50` and all 18 merged configurations.
+- All 36 even ground sizes `40,42,...,110` for the existing paired template.
+- At `h=50`, `U=4389`, `F=2304`, and the conditional role floor
+  `50 U + ceil(50 F/2) + 50 binom(49,2) = 335850`, versus the necessary target
+  budget `R <= 317035` for the historical `2^-30` target.
+- The finite favorable-bound peak at `h=52`, the `h=112` tail endpoint, and the
+  recorded 48-role reduction from `509194` to `509146`.
+
+The independent arithmetic module treats circuit node classifications, merge
+counts, and frame predicates as supplied inputs. The full producer replay
+recomputes those finite circuit facts. Neither check proves the infinite family
+by finite enumeration: the tail relies on the written argument that distinct
+unshareable outputs imply `R >= 6v`, and on monotonicity of
+`1 / ((14h^3 - 1) log(h^3))`. The historical obstruction retains the `c+q` compiler,
+separate partial outputs, original central losses, and the old assembly inequality
+`kappa < a_b/5`. It must not be transferred to the selected PR890 construction.
+
+This is a completed replay of the old domain, not an enlarged search. The search
+stopping rule, finite coverage, and general counting argument are unchanged.
+No general circuit lower bound, full multiplication theorem, or new exponent
+saving is claimed. The selected result at the pinned base is still PR890's
+conditional `1661957774647029/10^18`.
+
+## Attribution, coordination, and receipts
+
+The mathematical construction and original audit are Douglas R. Colkitt's
+historical research, retained by commit
+`d55bcd62ceb8f322bcf311a5a66e94c3ac7724f0`, with the repository's existing OpenAI
+Codex assistance disclosure. This contribution is by **woklerx**, with substantial
+OpenAI Codex assistance, including independently assigned dependency and arithmetic
+reviews. It claims no priority for the obstruction or the historical circuit.
+New files follow the repository's Apache-2.0 license; predecessor notices remain
+in place.
+
+[CLAIM.md](CLAIM.md) records OS-random seed 99, the three candidates, the narrow
+scope, and bounded overlap searches. The public issue list contained no pinned
+sprint issue, so the claim was recorded locally. PR867's selected-799 provenance
+map is related prior work, but concerns different source packages; PR756 and
+PR824 address faster Fano and stage-pair replays. This contribution binds and
+replays the older bit-compression obstruction without changing their work.
+
+[REPLAY.json](REPLAY.json) records the full comparison, environment, eight-helper
+runtime inventory, and independent arithmetic result.
+[VALIDATION.json](VALIDATION.json) pins the new implementation and records all
+four successful commands: 23 controls normally, the same 23 under `-O`, the
+predecessor's seven tests, and the final integrated full replay (about 51 seconds
+on this Windows/Python 3.14 host). These are local execution receipts; hosted CI
+and independent human mathematical review remain separate.
diff --git a/research/bit-compression-provenance/REPLAY.json b/research/bit-compression-provenance/REPLAY.json
@@ -0,0 +1,62 @@
+{
+  "assignment_seed": 99,
+  "base_commit": "007664306fff84fbb1c9a1b4053b69f439764034",
+  "canonical_certificate_sha256": "5675a64088357f173aa241299ce00914b09ced14afef5d76b4d34d823f6ca1e5",
+  "historical_certificate_sha256": "53effc15424ca20be4e92e8d7b66599b513f208cce1863176fdd1347a46faf90",
+  "historical_source_pin_count": 2,
+  "independent_arithmetic": {
+    "baseline_roles": 509194,
+    "best_roles": 509146,
+    "global_rows_checked": 18,
+    "global_rows_with_matching_local_count_rows": 8,
+    "limitations": [
+      "U/F, local additions, and merge counts require circuit replay or separate proof.",
+      "Recorded symbolic and frame flags are cross-checked, not proved by this module.",
+      "Infinite-tail circuit hypotheses are a written argument, not finite replay.",
+      "No all-size theorem, general optimality, or new multiplication witness is certified."
+    ],
+    "local_rows_checked": 73,
+    "log_method": "24-term rational atanh series with geometric remainder",
+    "paired_finite_range": [
+      40,
+      110,
+      2
+    ],
+    "paired_finite_rows_checked": 36,
+    "paired_h50_frontier": 2304,
+    "paired_h50_role_floor": 335850,
+    "paired_h50_unshareable": 4389,
+    "paired_peak_h": 52,
+    "role_reduction": 48,
+    "scope": "Existing paired local template, arbitrary independent relabelings, equal-sum identification and pruning only; c+q compiler, separate partial outputs and original central losses retained.",
+    "status": "PASS: independent arithmetic; circuit counts are certificate inputs",
+    "tail_cutoff": 112,
+    "target_h50_integer_role_budget": 317035
+  },
+  "input_count": 32,
+  "local_python_files": 9,
+  "platform": "Windows-11-10.0.26300-SP0",
+  "producer_replay": {
+    "all_certificate_fields_equal": true,
+    "loaded_local_modules": {
+      "certify": "scripts/certify.py",
+      "exclusion_circuit": "scripts/exclusion_circuit.py",
+      "experiments.bit_compression": "scripts/experiments/bit_compression.py",
+      "paired_exclusion_circuit": "scripts/paired_exclusion_circuit.py",
+      "prepare_layers": "scripts/prepare_layers.py",
+      "search_network": "scripts/search_network.py",
+      "shared_point_circuit": "scripts/shared_point_circuit.py",
+      "shared_point_network": "scripts/shared_point_network.py"
+    },
+    "seconds": 50.597238,
+    "status": "PASS",
+    "stderr": [],
+    "stdout": [
+      "PASS bounded bit compression: 509194 -> 509146 roles; no new kappa.",
+      "Paired-template relabel/merge-only route excludes 2^-30 for every admissible even h."
+    ]
+  },
+  "python": "3.14.5",
+  "source_manifest_sha256": "2700e579a70d01f315a8c3bb19b73686135d8b79f694055af3f535028e01734b",
+  "status": "PASS"
+}
diff --git a/research/bit-compression-provenance/SOURCES.json b/research/bit-compression-provenance/SOURCES.json
@@ -0,0 +1,79 @@
+{
+  "assignment_seed": 99,
+  "base_commit": "007664306fff84fbb1c9a1b4053b69f439764034",
+  "certificate": "certificates/bit-compression-audit.json",
+  "entrypoint": "scripts/audit_bit_compression.py",
+  "files": {
+    "certificates/bit-compression-audit.json": "53effc15424ca20be4e92e8d7b66599b513f208cce1863176fdd1347a46faf90",
+    "docs/research/bit-compression-audit.md": "d97764832d3ea1fe813623431b42383e3ffd713d83863de275425853fd85469d",
+    "scripts/audit_bit_compression.py": "f0ed48592a885b54669d3f9086530fc84c467c39fd9281b357ba7550549aaa25",
+    "scripts/certify.py": "2348d95008276c5d5764f7e028c3918e484582cd589bd4d9b82919161745e53e",
+    "scripts/exclusion_circuit.py": "b253f9d7318becda1c1f3b24e2287ed44a9c27fcea00cf9d531afb950d0457a0",
+    "scripts/experiments/bit_compression.py": "d1e6726341b3619262cc07246c3420584f46bdf57d44f1946d8dab18334cbca8",
+    "scripts/paired_exclusion_circuit.py": "8f05f04cf06217befd6d0ee0f2d7d0c5c5eb32cfab8c9a8ca7917fd6d620b7d2",
+    "scripts/prepare_layers.py": "a6e2adc612f264b1c0e51d18ce6315de9ae5e2ae2420aa22e99a22d8bf304947",
+    "scripts/search_network.py": "3a4faa5037d9b8e7ca5828afac193a96b6966a8b114f14937921795b24ec4f6a",
+    "scripts/shared_point_circuit.py": "c9bb7a5df92d260a4e3ad532b53e26936730d7c93f7facfb0784957c1e81c8ba",
+    "scripts/shared_point_network.py": "a85e7f0d8c42d6a27e3846308571ca324a1824ac5c2d59e4daa5c7673c33c697",
+    "tests/test_bit_compression.py": "865e6f32fbf36b9c1571e4654f87e5ce2116f568494383cf1b64954180ef4bc8",
+    "upstream/LICENSE": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4",
+    "upstream/README.md": "8d1ceff898a4e0e681679f91c4def485820be9e99f04e4861f2ce601a364723e",
+    "upstream/build/figures/multiplication-flow.tex": "3654d2728b0c98919d61760e1802804ed616546a747f9167a93e17bb8697f320",
+    "upstream/build/figures/proof-map.tex": "76d4deacf07bea355412abcfd798c7cbe6dcccef29a4a420a9e2a7b158f23848",
+    "upstream/build/main.tex": "42f0f506976bc2084374a71e97edc1549689a7accf35dda4db2a18af4f13c1aa",
+    "upstream/build/references.bib": "33cc2df13ccf85330849e8fb34d4ac7613b23f625787457a5b7b9aa6d7369476",
+    "upstream/build/sections/00-introduction.tex": "98721f03682ccf1cc7d0850b07adabaa2d8f3afe552e3861753eba9d284d0da0",
+    "upstream/build/sections/01-history.tex": "798956c8150c31e3e2f5f29c47110d25ce619faad1374f4d3a0f15fa3ee33ead",
+    "upstream/build/sections/02-streams.tex": "606c80db61cad13aa0c3b6060dc4b88dbbe7ac60cdd831aa93f28d908fd09dab",
+    "upstream/build/sections/03-motifs.tex": "ed76761194988a01af77ead0ea6469cb5dcd29690ab985a0b5a4006b0f2b69bb",
+    "upstream/build/sections/04-swap.tex": "412b170ccaab38dba96e95e3cbfae09f4876a9818f8d278776a746b0f8044906",
+    "upstream/build/sections/05-layers.tex": "20cfc8d12099d4e4ed9e3e7eeb6162edd9b6e0e076f24693364cd24377252594",
+    "upstream/build/sections/06-transforms.tex": "924316e4bc905066281d8f9e8746a49d8829aeb393688608deb1e61c3c87853c",
+    "upstream/build/sections/07-resampling.tex": "8a6b91670f9163afb54892489fa2210c77fe1b058f0325ec7d18b44b94be6e2c",
+    "upstream/build/sections/08-assembly.tex": "763d7945b1e1ec4ebae9b799bcefcc45fa9bae6e2ffad799868a9c3d513dbd4a",
+    "upstream/build/sections/09-exact-arithmetic.tex": "5714e5d0656c78c6a1fde8d01fd11f1ba856a7ea94149b283bd9a50fdbf516c3",
+    "upstream/build/sections/10-transposition.tex": "c14ad8d56112f6578678a58211bc8d63c3a4b60e55078ac73bc38f7348e713cb",
+    "upstream/build/sections/11-grouped-rectangles.tex": "6525cd0a01980e56accfeaf06e9d875bc699197ba42c6e22b69435e352275174",
+    "upstream/formalization.yaml": "2dcbd0d6e6a22475f53d49bfdfcac9b6d2b470653c332a9f56522f5be166edb9",
+    "upstream/manifest.json": "16ab13971694cabab09440c47ebf2fc0496a9d35fc3af33950fda3498f8e2392"
+  },
+  "local_import_graph": {
+    "scripts/audit_bit_compression.py": [
+      "scripts/certify.py",
+      "scripts/experiments/bit_compression.py",
+      "scripts/paired_exclusion_circuit.py",
+      "scripts/prepare_layers.py",
+      "scripts/search_network.py",
+      "scripts/shared_point_circuit.py",
+      "scripts/shared_point_network.py"
+    ],
+    "scripts/certify.py": [
+      "scripts/search_network.py"
+    ],
+    "scripts/exclusion_circuit.py": [],
+    "scripts/experiments/bit_compression.py": [
+      "scripts/exclusion_circuit.py"
+    ],
+    "scripts/paired_exclusion_circuit.py": [
+      "scripts/exclusion_circuit.py"
+    ],
+    "scripts/prepare_layers.py": [
+      "scripts/certify.py",
+      "scripts/search_network.py"
+    ],
+    "scripts/search_network.py": [
+      "scripts/certify.py"
+    ],
+    "scripts/shared_point_circuit.py": [
+      "scripts/exclusion_circuit.py"
+    ],
+    "scripts/shared_point_network.py": [
+      "scripts/certify.py",
+      "scripts/search_network.py",
+      "scripts/shared_point_circuit.py"
+    ]
+  },
+  "schema": "historical-bit-compression-inputs-v1",
+  "scope": "Repository-local input closure for the historical producer and one focused test module. Interpreter and standard-library implementation are recorded as environment, not source-pinned. Full generator replay checks all certificate fields; old source_sha256 is preserved.",
+  "upstream_commit": "adc7f1241b42e322a6451854ab7e4b4c146bf78a"
+}