diff --git a/research/denominator-capped-commutator/README.md b/research/denominator-capped-commutator/README.md new file mode 100644 index 0000000000..6d486668a6 --- /dev/null +++ b/research/denominator-capped-commutator/README.md @@ -0,0 +1,203 @@ +# Sharp denominator-capped error of a rounded dirty commutator + +This contribution was produced by Nick Petalas. Apache-2.0. + +**Scoped written proof with exact finite corroboration; no new κ.** For the +rounded two-factor scalar model in Ali Romman's [Discussion #5257](https://github.com/CrocSwap/integer-mult-bounds/discussions/5257), +the exact maximum absolute completed-target error, when both contractive rational +coefficients have reduced denominators at most the integer D, is + +```text +D = 1: 0 +D >= 2: 3(D-1)/(2D) grid units. +``` + +This answers the denominator-restriction part of that discussion's next question. +Its residue law and its limiting 3/2-error family are predecessor results. +The new step is the sharp finite-cap upper bound, attainment at every cap +including even caps, and explicit finite source/dirt bounds for the attainer. +No predecessor census or numerical kernel is replayed. + +For example, denominator cap two gives exactly 3/4 rather than the unrestricted +3/2 bound. Restricting both coefficients to dyadic denominator dividing 2^p +gives exactly `3(1-2^-p)/2` for p>=1, and zero for p=0. This follows because +that class lies within the cap 2^p and contains its attaining pair. + +## Model and theorem + +Let `R(t)=floor(t+1/2)` (nearest, ties toward positive infinity), and let +`a,b` be rationals with `|a|,|b|<=1`. Their reduced positive denominators +are at most D. For arbitrary integer registers x,y,z execute chronologically + +```text +z += R(a*x) +y += R(b*z) +z -= R(a*x) +y -= R(b*z) +``` + +The inverse calls subtract the same rounded quantity. Independently rounding +a negative coefficient is a different operation at half ties. Coefficient +products are exact; there is no overflow or internal rounding of multiplication. +The source and borrowed connector return exactly for every incoming value. +The target increment is `F=R(b(z+r))-R(bz)`, where `r=R(ax)` and z is incoming +connector dirt. The claimed error is `|F-abx|`, uniform in all x,y,z. + +On a grid of spacing h>0, replace R by `R_h(t)=h R(t/h)` and require the three +registers on hZ. Dividing the literal word by h gives the integer model, so the +maximum is h times the displayed bound. This is a completed-target statement, +not an internal-state, bit-width or whole-program precision guarantee. + +## Proof of the upper bound + +Write b=u/v in lowest terms, v>0. Divide `ur=kv+q`, with `0<=q=2, `|F-br| <= (v-1)/v`. This elementary residue observation is +the one used in #5257; its full distribution is not a new claim here. +Since `|r-ax|<=1/2`, + +```text +|F-abx| <= |b|/2 + (v-1)/v. +``` + +Reduced b with v>=2 cannot equal either endpoint ±1. Contractivity therefore +implies `|u|<=v-1`, giving + +```text +|F-abx| <= 3(v-1)/(2v) <= 3(D-1)/(2D). +``` + +This applies to both signs of a,b,x,z and to ties. If v=1, the outer operation +is exact on integer arguments and the error is at most 1/2, below the bound +for every D>=2. Finally D=1 makes both coefficients integers, so every shear +and the full product increment are exact. This proves all upper bounds. + +## An attainer at every cap + +For each D>=2 choose + +```text +a = 1/2, b = (D-1)/D, +x = 2D-3, z = -floor((D-1)/2), and arbitrary y. +``` + +The fractions are reduced and admitted, and `r=R(ax)=D-1`. +If D=2m, the two outer rounded values at z and z+r are `1-m` and m. +If D=2m+1, they are -m and m. These follow by substitution into R, including +the exact half tie in the even case. In either case the target increment is +D-1 and + +```text +F-abx = (D-1) - (D-1)(2D-3)/(2D) = 3(D-1)/(2D). +``` + +This also establishes that the cap maximum is attained, rather than approached +only as the input or dirt tends to infinity. The same maximum already occurs +under the additional restrictions `|x|<=2D-3` and +`|z|<=floor((D-1)/2)`. These are sufficient witnessing bounds; no minimality +of either magnitude bound is asserted. y can be any integer. For D=1 every +input attains the zero maximum. + +## Reproduce + +Use CPython 3.12 and the standard library, from the repository root: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/denominator-capped-commutator/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/denominator-capped-commutator/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/denominator-capped-commutator +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/denominator-capped-commutator --check-source-history +``` + +Other hosts may substitute their installed CPython 3.12 path. The direct marker +is `PASS_DENOMINATOR_CAPPED_COMMUTATOR`. The verifier writes nothing; redirect +stdout outside the checkout to retain its generated receipt, which binds all +five package files by SHA256. No result receipt is handwritten. + +The fixed finite check enumerates all 2,025 signed contractive reduced coefficient +pairs through denominator eight and all 384,085 source/dirt residue inputs. It +also checks 375 attaining caps (1,125 executions), including dyadic caps through +2^128, and 1,323 signed period fixtures. Normal and optimized commands each +took about 2.1 seconds locally on CPython 3.12.15, below the registered 120-second +limit. These timings are execution-budget evidence, not a performance claim. +For a=u/s and b=v/t, the error has source period st and dirt period t: +translation by st changes r by ut and F and abx by the same integer uv; +translation by t shifts both outer round arguments by v. Thus the finite +coefficient-domain maxima cover arbitrary signed integer inputs, not a chosen +magnitude window. The universal all-cap theorem still rests on the proof above. +Literal Fraction-based four-shear execution is compared at every visited input +with a separately written integer quotient formula. Additional checks cover the +all-cap attaining family, large dyadic caps, signed period identities, integer +coefficients, contractivity/denominator escapes, half ties, inverse semantics, +dirt-dependent output, invalid caps and exact dirty return. No external executable +or predecessor verifier is imported. + +## Scope, sources and credit + +The [advance CLAIM](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19601567) +preceded the new verifier. Canonical base is +`e54523517d0f03e58352e647c403a5af3e525a57`, priority revision 8. The selected +record is #7000, κ=0.00363005817; the catalogue's #5599 headline is historical. +Selected source-binding orientation passed; it is not a supplier replay. +The original `uniform-transfer-audit` card changes to this local precision side +result. No selected assumption is discharged and the selected frontier is unchanged. + +Credit Ali Romman / aliromman for Discussion #5257's exact residue law, +unrestricted sharpness family and explicit bounded-denominator question. +The construction here specializes that credited family at a finite cap and +extends its stated odd-denominator parameter range to every D>=2; it is not a +new commutator mechanism. Adam Gall / adamgall #2067 supplies the deterministic +correlation question and independent-defect context. Chafik Boukhalfa / chafreaky +#628 supplies the dirty commutator; its retained nonlinear-restoration and +numerical/kernel predecessors keep their credit. Classical floor/residue and +triangle inequalities retain their usual mathematical credit. No broad +literature-priority claim is made. The question URL, author and body SHA256 +at retrieval are recorded in TASK.json. The Adam Gall README, catalogue and +selected record are historical Git provenance only, with no runtime dependency. + +Live open/account PR lists, recent handoff/active claims, local reservations, +distinctive main-tree terms and merged-PR searches were checked. No matching +cap theorem was found in that coverage; sparse notes, arbitrary diffs and +unpublished work remain limitations. ToikY #6685 studies a refined-helper ABI +with an integer source injection and a fixed coarse output grid, building on +Ali Romman #1135 and Nick Petalas #6666. It does not impose this contractive +rational-pair denominator cap or compute this quantity. Nick Petalas #5931 +changes dirty-word split trees under independent defects; its construction is +not used here. Their results are cited without being audited. + +## Limitations + +This is the specified scalar model and half-up rounder. It does not identify +PR1054's numerical leaf with a single scalar shear, install an actual production +coefficient cap, cover arbitrary rounding conventions, larger trees, approximate +coefficient multiplication, overflow, intermediate magnitude, physical tape +movement, native frames, dirty allocation or a complete paid supplier invoice. +All five selected framework assumptions remain. The selected cold replay, +Lean and Docker are unrun. Independent human and formal proof-kernel review +are unclaimed. + +The verifier has no recursion, subprocess, network, dynamic code or writes. +Its scientific loops have fixed finite domains; cap/witness helpers validate +positive integer caps below 2^256. Each function stays below 60 physical lines. +Explicit checks remain active with `-O`. Python Fractions and containers allocate +dynamically, a managed-runtime deviation from fixed allocation; the complete +fixed driver and 256-bit cap restriction bound live data. Only the five named +local files are read for hashes. A fixed-storage implementation would be needed +to remove that deviation. Warning-strict normal/optimized commands are registered; +no separate static type checker is configured. + +## Open next questions + +For one named production leaf, which coefficient-denominator and input/dirt bounds +can actually be proved? Start by pinning its rounding convention, coefficient +table and entrance grids. Then derive its reduced denominators and pay every +conversion, inverse, temporary, source read, storage and routing operation. The +missing kernel identification and complete bill block any production precision +or multiplication claim. Smaller simultaneous magnitude boxes and larger trees +are left to separate investigations. diff --git a/research/denominator-capped-commutator/SOURCES.json b/research/denominator-capped-commutator/SOURCES.json new file mode 100644 index 0000000000..aa6fa5640f --- /dev/null +++ b/research/denominator-capped-commutator/SOURCES.json @@ -0,0 +1,24 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/dirty-endpoint-error-accumulation/README.md", + "usage": "provenance", + "git_blob": "4eca419a29fb0b8d8e739c7683deb52552c92061", + "sha256": "303ded6732ea367eece2853d4e5725713cd8c6a4db1a35333549407dabbf1d8b" + } + ] +} diff --git a/research/denominator-capped-commutator/TASK.json b/research/denominator-capped-commutator/TASK.json new file mode 100644 index 0000000000..d7f55ad401 --- /dev/null +++ b/research/denominator-capped-commutator/TASK.json @@ -0,0 +1,89 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Exact sharp denominator-capped error for the rational contractive two-factor scalar rounded dirty commutator.", + "scope_change_reason": "A local precision side result answering the bounded-denominator direction in Ali Romman Discussion #5257; no actual selected caller or inherited assumption is discharged.", + "bottleneck_link": "Quantifies how a coefficient-denominator restriction improves a deterministic endpoint error guard; physical kernel binding and cost remain separate.", + "budget_minutes": 60, + "stop_rule": "Ship the first verified all-cap sharp error formula; do not extend to larger trees or optimize physical callers.", + "outcome": "completed", + "evidence": "README.md gives the all-cap proof and attaining family. verify.py checks literal four-shear errors with an independent integer quotient engine and emits a SHA256-bound receipt.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "For a named production leaf, what coefficient-denominator and input/dirt bounds are actually available?", + "why_it_matters": "The abstract cap saving applies only after this scalar model and its scale are justified.", + "first_step": "Pin one leaf and its rounding convention, coefficient table and legal entrance grids, then derive rather than assume its reduced denominators.", + "blocked_by": "No production scalar-kernel identification or complete arithmetic/storage/routing invoice is supplied." + } + ], + "question_source": { + "url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/5257", + "author": "aliromman", + "body_sha256_at_read": "9518b89140ed19a7596aadc42f22a27b2465c96ef40158dfeba8e8b15f099249" + }, + "claim_url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19601567" +} diff --git a/research/denominator-capped-commutator/VERIFY.json b/research/denominator-capped-commutator/VERIFY.json new file mode 100644 index 0000000000..3d42f91ba6 --- /dev/null +++ b/research/denominator-capped-commutator/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Complete signed coefficient/residue domains through denominator eight; all-cap and dyadic attainers, period identities and semantic/domain controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "The same complete checks with Python assertions disabled." + } + ] +} diff --git a/research/denominator-capped-commutator/verify.py b/research/denominator-capped-commutator/verify.py new file mode 100644 index 0000000000..107fcbff50 --- /dev/null +++ b/research/denominator-capped-commutator/verify.py @@ -0,0 +1,149 @@ +"""Sharp denominator-capped error; exact arithmetic, fixed finite domains.""" +from fractions import Fraction +from hashlib import sha256 +from pathlib import Path +import json +from math import gcd + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def rounded(value): + shifted = value + Fraction(1, 2) + return shifted.numerator // shifted.denominator + + +def literal(a, b, x, y, z): + """Four actual integer-register updates, including both inverse calls.""" + z += rounded(a * x) + y += rounded(b * z) + z -= rounded(a * x) + y -= rounded(b * z) + return x, y, z + + +def quotient_error(a, b, x, z): + """Integer-only representation, independent of Fraction-round execution.""" + u, s = a.numerator, a.denominator + v, t = b.numerator, b.denominator + r = (2 * u * x + s) // (2 * s) + high = (2 * v * (z + r) + t) // (2 * t) + low = (2 * v * z + t) // (2 * t) + return Fraction((high - low) * s * t - u * v * x, s * t) + + +def cap_bound(cap): + need(type(cap) is int and 1 <= cap < 2**256, 'cap domain') + return Fraction(0) if cap == 1 else Fraction(3 * (cap - 1), 2 * cap) + + +def witness(cap): + need(type(cap) is int and 2 <= cap < 2**256, 'witness cap domain') + return Fraction(1, 2), Fraction(cap - 1, cap), 2 * cap - 3, -((cap - 1) // 2) + + +def coefficients(cap): + return tuple(sorted({Fraction(u, s) for s in range(1, cap + 1) + for u in range(-s, s + 1) if gcd(u, s) == 1})) + + +def exhaustive(): + """Each pair's complete error periods; record its smallest cap.""" + maximum = [Fraction(0)] * 9 + pairs = [0] * 9 + visits = 0 + values = coefficients(8) + for a in values: + for b in values: + cap = max(a.denominator, b.denominator) + pairs[cap] += 1 + for x in range(a.denominator * b.denominator): + for z in range(b.denominator): + out = literal(a, b, x, 7, z) + need(out[0] == x and out[2] == z, 'arbitrary dirty return') + error = Fraction(out[1] - 7) - a * b * x + need(error == quotient_error(a, b, x, z), 'two arithmetic engines') + need(abs(error) <= cap_bound(cap), 'denominator-cap upper bound') + maximum[cap] = max(maximum[cap], abs(error)) + visits += 1 + rows = [] + running = Fraction(0) + for cap in range(1, 9): + running = max(running, maximum[cap]) + need(running == cap_bound(cap), 'exact finite cap optimum') + rows.append({'cap': cap, 'new_pairs': pairs[cap], 'maximum': str(running)}) + return {'rows': rows, 'pairs': sum(pairs), 'literal_visits': visits} + + +def families(): + caps = tuple(range(2, 257)) + tuple(2**p for p in range(9, 129)) + checks = 0 + for cap in caps: + a, b, x, z = witness(cap) + need(max(a.denominator, b.denominator) == cap, 'reduced denominator') + for y in (-17, 0, 23): + out = literal(a, b, x, y, z) + need(out[0] == x and out[2] == z, 'witness restoration') + error = Fraction(out[1] - y) - a * b * x + need(error == cap_bound(cap), 'all-cap positive attainer') + need(error == quotient_error(a, b, x, z), 'witness second engine') + checks += 1 + periods = 0 + for a in coefficients(5): + for b in coefficients(5): + step = a.denominator * b.denominator + for x, z in ((-11, -7), (0, 0), (13, 9)): + base = quotient_error(a, b, x, z) + need(base == quotient_error(a, b, x + step, z), 'source period') + need(base == quotient_error(a, b, x, z + b.denominator), 'dirt period') + periods += 1 + return {'attaining_caps': len(caps), 'attaining_executions': checks, + 'signed_period_checks': periods, 'largest_cap': str(caps[-1])} + + +def controls(): + a, b, x, z = witness(3) + need(quotient_error(a, b, x, z) > cap_bound(2), 'larger denominator escapes') + need(quotient_error(Fraction(1, 2), Fraction(2), 1, 0) > cap_bound(2), + 'expansive outer coefficient escapes') + need(rounded(Fraction(-1, 2)) != -rounded(Fraction(1, 2)), + 'negated coefficient does not implement inverse') + need(literal(Fraction(1, 2), Fraction(1, 2), 1, 0, 0)[1] == 1, + 'half-up tie fixture') + need(literal(Fraction(1, 2), Fraction(1, 2), 1, 0, 1)[1] == 0, + 'dirty-dependent output despite exact return') + rejected = 0 + for cap in (0, -1, True, Fraction(2), 2**256): + try: + cap_bound(cap) + except ValueError: + rejected += 1 + need(rejected == 5, 'invalid cap rejection') + try: + witness(1) + except ValueError: + rejected += 1 + need(rejected == 6, 'integer-only cap has no positive-error witness') + for a in coefficients(1): + for b in coefficients(1): + for x in (-10, 0, 11): + need(literal(a, b, x, 4, -3) == (x, 4 + a * b * x, -3), + 'integer-only exact endpoint') + return {'semantic_controls': 6, 'domain_rejections': rejected} + + +def main(): + result = {'marker': 'PASS_DENOMINATOR_CAPPED_COMMUTATOR', + 'exhaustive': exhaustive(), 'families': families(), 'controls': controls()} + package = Path(__file__).resolve().parent + names = ('README.md', 'TASK.json', 'SOURCES.json', 'VERIFY.json', 'verify.py') + result['sha256'] = {name: sha256((package / name).read_bytes()).hexdigest() + for name in names} + print(json.dumps(result, sort_keys=True, indent=2)) + + +if __name__ == '__main__': + main()