Skip to content

Audit exact local billing for the encoded selected ADD - #2473

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
ywz65:ywz65/research-round-052
Oct 16, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
ywz65:ywz65/research-round-052

Conversation

@ywz65

@ywz65 ywz65 commented Oct 15, 2026

Copy link
Copy Markdown
Contributor

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:

  • Exact counter lifecycle formulas, including N=0, powers of two and the final 1-to-0 decrement. Canonical spectator widths are necessary; an arbitrarily padded singleton breaks a volume-only bound and is rejected by the source.
  • Exact payload movement (10V+13, 3V, 10V+16) for reads/writes/moves. Combined with counters and extent checks, a conservative bound is 947V symbol operations.
  • Conditional arithmetic/preparation O(B + UM L^2). The retained root-coupled B <= A_q w^1800 yields the source's local C_q V result 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:

python3.12 scripts/research_package.py --package research/binary-add-cost-audit

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.

@Mister-Meeseeks
Mister-Meeseeks merged commit 81ff1f5 into CrocSwap:main Oct 16, 2026
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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants