Repository navigation
Audit exact local billing for the encoded selected ADD - #2473
Merged
Merged
Conversation
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 17, 2026
#2915's ordered high-field ADD Answers the ordered-ADD component of PR #2982's single-cube handoff for the unchanged PR #2915 kernels.added and its pooled stream.add_pass. For odd Q>=3, canonical positive B,M,S and c in {-4,-2,-1,1,2,4}, with V=BQMQS: exactly 10+[S>1] additional scratch roles suffice and are attained in every call, sharpening PR #2809's conservative 32-role lexical allowance; six additional numerical words suffice and one fixture attains six (PR #2810's add_pass bound composed with the actual coefficient callback); and the complete local physical read/write/ unit-move bill, including encoded arithmetic and pool acquisitions, is at most 4096V, or 4102V with returned-output disposal. The exact non-arithmetic invoice extends PR #2877's and PR #2473's countdown and payload bills, zero case included, with pool acquisitions, the one-bit-suffix path and the marginal lifecycles. It matches the unchanged source on 109 complete packets (37,241 payload bits), and one fewer scratch role or numerical slot rejects at the real allocators. Route setup, B1 swaps, machine steps, physical backing and whole-stage stock remain open; no supplier, selected-frontier or kappa change is claimed. Adds research/high-add-scratch-invoice/ 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.
PR2449 proves a linear local charge for its encoded ADD using amortized counters. This independent audit derives exact all-length countdown bills from that source, includes separately metered input-word reads, and accounts for the complete split/merge traversal, scratch erasure and head returns. It confirms the local implication under the stated callback tariff; no defect or new exponent is claimed.
The reviewed source is
ef4640fbf9c360ef66dbc5d29916e741d515bf39. The new package retains only the three runtime modules and their proof/README/NOTICE, byte-for-byte, with Git blobs and SHA256 pins. It imports none of PR2449's checker, oracle, coefficient generator or receipt.The proof separates three costs:
(10V+13, 3V, 10V+16)for reads/writes/moves. Combined with counters and extent checks, a conservative bound is 947V symbol operations.O(B + UM L^2). The retained root-coupledB <= A_q w^1800yields the source's localC_q Vresult by explicit factorial absorption.The executable calls its coefficient callback twice total, once per traversal, at one fixed current prefix. The review states that boundary explicitly. It does not supply a varying-header driver, complete residual, recursive child, full selected callback proof, finite-machine compiler or global family/owner caller. Jose Manuel's active residual implementation remains separate work.
Validation: CPython 3.12.7 registered normal/optimized replay and CPython 3.14.5 optimized primary pass. There are 1,026 complete counter cases, 386 full Boolean-basis forward/inverse cases, exact operation invoices, five semantic controls and five test groups. Tests catch extra source reads, omitted erasure, changed split/merge coefficients, wrong inverse sign, source/receipt corruption and missing receipts; a read-only Git-free export passes. An independent agent reviewer checked the all-length derivation and added 36 counter boundary cases through 8193 and 18 simultaneous-spectator mixed-payload inverse cases; no material issue found. No independent human or formal-kernel review is claimed.
Reproduce with Python 3.12:
Base: canonical main
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4, freshly fetched. The selected frontier and frozen inputs are unchanged. TASK.json records scope, overlap coverage and limits. Open next questions focus on reviewing the separately developed residual composition and formalizing the counter transition model.Credit Jose Manuel (
jmbarrancoml) for PR2449/2405 and its retained source527, supplier, descriptor, stream and relative-origin lineage. Prepared for ywz65 with substantial OpenAI Codex assistance in derivation, implementation, checking and writing.