Repository navigation
Exact minimum-bit allocation for a fixed dyadic error budget - #5307
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
Conversation
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.
This algorithm minimizes total added fractional bits for fixed rational error weights and equal cost per bit. The executable allocator uses diminishing marginal gains; the proof gives optimality at every total bit count. The package includes a counterexample to extending the rule to unequal bit prices. The complete kappa calculation is unchanged.
Proof and scope, exact checker, replay declaration, and source provenance are pinned to the reviewed commit. Base: canonical main
ff3cc58e370d0f678e529246f8c73e8094e18fcf, priority revision 7.The initial proof and standalone check are in Discussion #5293.
CPython 3.12.14 registered normal and optimized replays passed: 480 allocation instances, 13,565 exhaustive allocations, five input controls and an unequal-price counterexample. Both print
PASS_DYADIC_BIT_ALLOCATION; the launcher printsPASS_REGISTERED_RESEARCH_PACKAGE. All five package files match their committed bytes, and the base is an ancestor of the package commit.Use Python 3.12 and the standard library. No external runtime inputs or third-party Python packages are required. Hosted planning and the registered package replay passed on this exact head in run 39990060979. No predecessor scientific suite, selected cold replay, native replay, compiler, Lean or Docker build was run. The optional full-history preflight is unavailable in this shallow checkout. Finite checks corroborate the written proof; they do not constitute independent human or proof-kernel acceptance.
Bind fixed error weights and real bit prices to one emitted circuit. Source preparation, native operations, precision, movement, and supplier/outer admission remain separate obligations.
Sources, limits and next step. Credit ywz65's PR #2701 and its pinned noise contract, Vlado Vojdanovski's PR #1673, and Nick Petalas's separate PR #5153 endpoint refinement. The greedy argument is a classical separable diminishing-return allocation method; the contribution is this exact, executable dyadic precision contract and its boundary controls, not a new general greedy theorem.
Prepared by Ali Romman with substantial OpenAI Codex assistance; Apache-2.0.