diff --git a/docs/ci-verification.md b/docs/ci-verification.md index 63ba3e9aa8..52b62d0481 100644 --- a/docs/ci-verification.md +++ b/docs/ci-verification.md @@ -1,8 +1,25 @@ # CI verification -## Current selected-family replay: #6030 +## Current selected-family replay: #7000 with #7001 The [selected record](../certificates/selected-result.json) binds conditional +κ = 0.00363005817 to the [application review](research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), +[validation receipts](research/pr-intake-evidence/pr7000-application/VALIDATION.json), +and [explicit source closure](../certificates/frontier7000-source.json). +`make frontier7000-verify` follows that exact-source selected replay. The review +reuses eleven authenticated preceding executions and records seven fresh serial +application, scalar and complete native-catalogue executions. The earlier +monolithic timeout is retained separately and is not completed coverage. +Consult the receipts for exact commands, source heads and limits. + +The five inherited framework assumptions remain. No complete uniform word, +literal multiplier execution, independent human proof or formal-kernel proof +is asserted. Routine research submissions do not need to rerun this +selected-family replay. The sections below preserve historical checkpoints. + +## Historical selected-family replay: #6030 + +The [historical checkpoint](../certificates/checkpoints/frontier6030.json) binds conditional κ = 0.003125804 to the [proof review](research/pr-intake-evidence/pr6030-audit/PROOF-REVIEW.md), [validation receipts](research/pr-intake-evidence/pr6030-audit/VALIDATION.json), and [explicit source closure](../certificates/frontier6030-source.json). diff --git a/research/gaussian-rounder-exact-period/PROOF.md b/research/gaussian-rounder-exact-period/PROOF.md new file mode 100644 index 0000000000..10e7068aee --- /dev/null +++ b/research/gaussian-rounder-exact-period/PROOF.md @@ -0,0 +1,156 @@ +# The sharp Gaussian radial budget at exact period + +Let `s=x+y` and `d=x-y` for Gaussian integers `x,y`. The ideal +positive half-transform sends the pair to `((s+i*d)/2,(s-i*d)/2)`. +A rounder must map Gaussian pairs to Gaussian pairs, preserve `s` +and have Euclidean pair error at most one. Its forward outward slack +is the supremum of `max(0, ||F(z)||-||z||)` over Gaussian pairs `z`. + +**Theorem.** A rounder of finite global least period `m` exists exactly +when `4` divides `m`. For each such `m`, let `R` be the least odd +integer at least five that does not divide `m`. The minimum forward +outward slack at exact least period `m` is + +```text +beta_R = sqrt((R^2+2R+3)/2) - sqrt((R^2+1)/2). +``` + +The same construction has absolute radial change and inverse outward +slack at most `beta_R`. + +## Starting map and lower bound + +Ali Romman's PR #7714 supplies two premises for rounders satisfying +the prescribed iterate identity `F^m=id`. It rules out such a map +unless `4` divides `m`, and in the divisible case proves the lower +bound `beta_R` and constructs a total rounder `F_0` attaining it +with absolute radial change at most `beta_R`. Since a map of least +period `m` satisfies the iterate identity, the necessity and lower +bound carry over. We use the stated results of #7714 directly. +[Finite iterate proof](https://github.com/aliromman/integer-mult-bounds/blob/ba5e006ed70119b23d6ef9e2e8627e43a3f4f18b/research/gaussian-finite-iterate-optimum/PROOF.md) + +Only the sum-one fiber will change. Use the doubled half-grid +coordinates `(X,Y)` of #7714, with source color + +```text +A = {(X,Y) : X and Y odd, X+Y = 0 mod 4}. +Q(X,Y) = (Y,-X). +``` + +For difference `d=d_r+i*d_i`, the coordinate vector is +`(d_r-d_i,-d_r-d_i)`. This is a bijective coordinate change on +the sum-one fiber. The pair squared norm at `(X,Y)` equals +`1/2+(X^2+Y^2)/4`. An edge in these coordinates has error one +exactly when undoing `Q` on its output makes that output an +axial neighbor of the input at distance two. For example, the +inverse coordinates give `d_r=(X-Y)/2` and `d_i=-(X+Y)/2`. +The ideal edge sends the doubled coordinates to `Q(X,Y)`. +Changing the output by a vector of length two therefore changes +the difference by length sqrt(2) and the pair by length one. + +On the tail rings with doubled radii `(R+4j,R+4j+2)` for +`j >= 0`, the predecessor uses `g_0=Q M`. Here `M` is the +annular matching adapted from Jerry Chen's PR #7570. It commutes +with `Q` and satisfies `M^2=id`, so `g_0^2=Q^2=-id` on these +rings. Every orbit there has length four. +[Annular construction](https://github.com/CubeJerry/integer-mult-bounds/blob/053c42c68165cf24fd4e8bc33c2b20d6ac3d399b/research/sharp-order-four-gaussian-rounding/proof/PROOF.md) + +## A column of tangential pairs + +Write `q=m/4` and set + +```text +a = R+4(R(2q+4)+1) +y_k = a+2k, 0 <= k < q +x_0 = a-4, x_1 = a-2. +``` + +Each ring of radius `y_k` has the top-side pair +`(x_0,y_k) <-> (x_1,y_k)` in the predecessor matching. To see +this directly, on an inner ring of doubled radius `y` the +ordered top-side list runs from `-y+2` to `y-2` by twos. On an +outer ring it runs from `y` to `-y+4` by minus twos. Pair +consecutive entries starting at the first entry. For `y=y_k`, +the horizontal pairs in increasing order start at residues +`a mod 4` in either case. Both selected coordinates are in +the corresponding list, since `y >= a`, and `x_0 = a mod 4`. + +Let `p_k` be the point of this pair in `A`, and `u_k` its mate. +The orbit is `(p_k, Q u_k, -p_k, -Q u_k)`. These are `q` +distinct orbits because their points stay on rings of distinct +radii. The points `p_k` and `-p_k` are on opposite sides of +the ring and both belong to `A`. + +## Splice the cycles + +For each `k=0,...,q-2`, exchange the successors of +`p_k,p_(k+1)` when `k` is even. When `k` is odd, exchange the +successors of `-p_k,-p_(k+1)`. Consecutive switches use opposite +sides of their shared ring. Thus every changed source has its +original successor up to the time that successor is exchanged. + +Two odd horizontal coordinates separated by two have opposite +residues modulo four. The source therefore changes horizontal +coordinate from one top-side pair to the next. Before applying +`Q`, the two exchanged successors are consequently vertical +neighbors of the new sources. Negating the pairs preserves this +fact on the bottom side. Every new edge has Gaussian error one. +The edited permutation remains in the sum-one fiber. + +Exchanging the successors of two points in distinct cycles +merges those cycles. Starting at the first changed point, the +new orbit follows the second cycle until its changed point, +then follows the first cycle back to the start. In increasing +order of `k`, switch `k` joins the orbit containing rings +`0,...,k` to the untouched cycle on ring `k+1`. This produces +one cycle of length `4q=m` and leaves every other orbit of +`F_0` intact. For `q=1` the selected orbit already has length +four. The full new map has `F^m=id` because every untouched +orbit already has length dividing `m`. The constructed orbit +forces the least period to be exactly `m`. + +For example, at `m=8` the first incompatible odd radius is +`R=5`. The splice on rings 169 and 171 gives the cycle + +```text +(167,169), (171,-167), (-165,-171), (-171,167), +(165,171), (169,-165), (-167,-169), (-169,165). +``` + +## Radial cost of a switch + +Rotation and negation preserve norm, so each new edge has +the absolute radial change of a vertical neighbor pair with +horizontal magnitude `x >= a-4` and vertical magnitudes +`y,y+2` for `a <= y < a+2q`. Rationalizing gives + +```text +(y+1)/(sqrt(1/2+(x^2+(y+2)^2)/4)+sqrt(1/2+(x^2+y^2)/4)) + <= (y+1)/sqrt(x^2+y^2) + <= (a+2q)/(sqrt(2)(a-4)) + < (1+1/(4R))/sqrt(2). +``` + +The second inequality uses the actual inner ordinate +`y <= a+2(q-2)` of a switch. For the last inequality, +`a-4 > 4R(2q+4)`. + +The bound on these edges is strictly below `beta_R`. In fact + +```text +sqrt(2)*beta_R - 1 + = 2/(sqrt((R+1)^2+2)+R+1) - 1/(sqrt(R^2+1)+R) + > 2/(2R+3) - 1/(2R) + >= 1/(4R). +``` + +Here `sqrt((R+1)^2+2) < R+2` and `R >= 5`. The old edges +have absolute radial change at most `beta_R` by #7714. The +lower bound from the iterate theorem forces equality for the +new map's forward outward slack. The predecessor's attaining +cycle at radii `R,R+2` is outside the splice and supplies +equality for the absolute and inverse outward bounds as well. + +This proof uses the exact-sum error-one contract and one mixed +sum fiber. A physical caller, tape and stock price, and any use +in a complete multiplication bound remain open. diff --git a/research/gaussian-rounder-exact-period/README.md b/research/gaussian-rounder-exact-period/README.md new file mode 100644 index 0000000000..14793a967a --- /dev/null +++ b/research/gaussian-rounder-exact-period/README.md @@ -0,0 +1,65 @@ +# Exact least period for Gaussian-pair rounding + +**Scoped proof.** An exact-sum Gaussian-pair rounder with Euclidean pair +error at most one can have finite global least period `m` exactly when +`4` divides `m`. Its sharp forward outward slack at that least period is +`sqrt((R^2+2R+3)/2) - sqrt((R^2+1)/2)`, where `R` is the least odd +integer at least five that does not divide `m`. The same construction +attains that bound for absolute radial change and inverse outward slack. + +The finite iterate theorem supplies the lower bound and a map whose +period divides `m`. The new construction joins `m/4` four-cycles on +consecutive rings in the sum-one fiber into one cycle of length `m`. +The switches alternate between opposite sides of the rings so each +changed edge still has error one. Moving the switches far enough +toward a corner keeps the new edges below the radial bound. +For instance, period eight attains `sqrt(19)-sqrt(13)`. +[Proof](PROOF.md) + +## Reproduce + +Run from the repository root. The local checks used CPython 3.12.15 +and only the standard library. + +```sh +pkg=research/gaussian-rounder-exact-period +python3.12 -B scripts/research_package.py --package "$pkg" +python3.12 -B scripts/check_research_commit.py --package "$pkg" --check-source-history +python3.12 -I -W error -B "$pkg/verify.py" +python3.12 -I -W error -O -B "$pkg/verify.py" +``` + +Both verifier modes print `PASS_GAUSSIAN_ROUNDER_EXACT_PERIOD`. +They check 20 orbits through period 13,860, including 16,940 Gaussian +edges and 8,430 switched successors. The four controls omit part or +all of the splice, reuse a source, or move the splice near the axis. +The written proof covers arbitrary admissible periods. The verifier +checks only the new construction on its stated fixtures. + +The contribution is a local precision result. Physical +implementation, caller pricing and any change to the conditional +multiplication bound remain open. The predecessor theorem is a cited +premise. Its suite, the selected cold replay, Lean and Docker were +unrun. Independent human and formal proof-kernel review are unclaimed. + +## Open next questions + +Which physical caller, if any, needs a prescribed least period? +Identify one caller and its row and address schedule. That would +give a concrete setting for pricing the local splice predicate, +coordinate arithmetic and workspace restoration. + +## Credit + +This contribution was produced by Nick Petalas. Ali Romman's +finite iterate optimum supplies the lower bound and the starting +permutation. Jerry Chen's annular matching supplies the geometric +construction it uses. Ali Romman's ring classification supplies +the lower-bound framework, and his exact-sum contract supplies the +Gaussian transform. [#7714 at ba5e006](https://github.com/aliromman/integer-mult-bounds/tree/ba5e006ed70119b23d6ef9e2e8627e43a3f4f18b/research/gaussian-finite-iterate-optimum), +[#7570 at 053c42c](https://github.com/CubeJerry/integer-mult-bounds/tree/053c42c68165cf24fd4e8bc33c2b20d6ac3d399b/research/sharp-order-four-gaussian-rounding), +[#7699](https://github.com/CrocSwap/integer-mult-bounds/pull/7699), +[#6509](https://github.com/CrocSwap/integer-mult-bounds/pull/6509). + +Apache-2.0. [Task](TASK.json) · [Source provenance](SOURCES.json) · +[Advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19718444) diff --git a/research/gaussian-rounder-exact-period/SOURCES.json b/research/gaussian-rounder-exact-period/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/gaussian-rounder-exact-period/SOURCES.json @@ -0,0 +1,18 @@ +{ + "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" + } + ] +} diff --git a/research/gaussian-rounder-exact-period/TASK.json b/research/gaussian-rounder-exact-period/TASK.json new file mode 100644 index 0000000000..bd74f86db0 --- /dev/null +++ b/research/gaussian-rounder-exact-period/TASK.json @@ -0,0 +1,95 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Exact global least period for total exact-sum Gaussian-pair rounding at error one and the sharp radial budget.", + "scope_change_reason": "PR #7714 separates the least-period requirement from the iterate identity. Resolve that local obligation with a written proof before considering any physical caller or formal integration.", + "bottleneck_link": "Local precision result. The finite iterate budget also applies when a local contract requires exact least period. A selected caller and a full price remain open.", + "budget_minutes": 60, + "stop_rule": "Stop after a verified least-period splice at the sharp budget, or report the specific remaining obstruction.", + "outcome": "completed", + "evidence": "PROOF.md gives the all-input construction using PR #7714 at ba5e006ed70119b23d6ef9e2e8627e43a3f4f18b. The exact verifier checks 20 affected orbits, 16,940 Gaussian edges, 8,430 changed successors and four controls.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "How could a finite Gaussian rounder with a prescribed exact period be priced in a physical caller?", + "why_it_matters": "The radial budget is a bound on output values, while a caller must also pay for branching, coordinate arithmetic, and restoration.", + "first_step": "Find one caller that uses a prescribed local period and measure its row and address schedule before pricing the local splice predicate.", + "blocked_by": "No selected caller with an exact least-period requirement has been identified." + } + ] +} diff --git a/research/gaussian-rounder-exact-period/VERIFY.json b/research/gaussian-rounder-exact-period/VERIFY.json new file mode 100644 index 0000000000..f3d86b37f4 --- /dev/null +++ b/research/gaussian-rounder-exact-period/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": 30, + "checks": "Exact splice edge geometry, Gaussian error, radial costs, orbit length and four negative controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 30, + "checks": "Exact splice edge geometry, Gaussian error, radial costs, orbit length and four negative controls." + } + ] +} diff --git a/research/gaussian-rounder-exact-period/verify.py b/research/gaussian-rounder-exact-period/verify.py new file mode 100644 index 0000000000..1dd4a2542d --- /dev/null +++ b/research/gaussian-rounder-exact-period/verify.py @@ -0,0 +1,146 @@ +#!/usr/bin/env python3 +"""Check the changed Gaussian edges and orbit lengths using integers.""" + +type Point = tuple[int, int] +type Pair = tuple[int, int, int, int] +type Cycle = tuple[Point, Point, Point, Point] + + +def require(condition: bool, message: str) -> None: + if not condition: + raise ValueError(message) + + +def negate(point: Point) -> Point: + x, y = point + return -x, -y + + +def tangent_cycle(left_x: int, y: int, inner: bool) -> Cycle: + """Use one top-side pair of the specified annular matching.""" + low, high = (-y + 2, y - 2) if inner else (-y + 4, y) + require(low <= left_x <= high - 2 and (left_x - low) % 4 == 0, + "top side does not contain the required pair") + left, right = (left_x, y), (left_x + 2, y) + source, mate = (right, left) if (left_x + y) % 4 else (left, right) + rotated_mate = (mate[1], -mate[0]) + return source, rotated_mate, negate(source), negate(rotated_mate) + + +def splice(cycles: list[Cycle], switches: int) -> dict[Point, Point]: + require(0 <= switches < len(cycles), "invalid number of switches") + successors: dict[Point, Point] = {} + for cycle in cycles: + for index, source in enumerate(cycle): + successors[source] = cycle[(index + 1) % 4] + for index in range(switches): + side = 2 * (index % 2) + left = cycles[index][side] + right = cycles[index + 1][side] + successors[left], successors[right] = successors[right], successors[left] + return successors + + +def orbit_length(start: Point, successors: dict[Point, Point]) -> int: + point = start + for length in range(1, len(successors) + 1): + point = successors[point] + if point == start: + return length + raise ValueError("orbit did not close within the population") + + +def gaussian_pair(point: Point) -> Pair: + """Invert the doubled half-grid coordinates in the sum-one fiber.""" + x, y = point + require(x % 2 == 1 and y % 2 == 1 and (x + y) % 4 == 0, + "point lies outside the sum-one source color") + difference_real, difference_imag = (x - y) // 2, -(x + y) // 2 + return ((1 + difference_real) // 2, difference_imag // 2, + (1 - difference_real) // 2, -difference_imag // 2) + + +def four_times_error(source: Pair, target: Pair) -> int: + left_real, left_imag, right_real, right_imag = source + dr, di = left_real - right_real, left_imag - right_imag + twice_ideal = (1 - di, dr, 1 + di, -dr) + return sum((2 * actual - ideal) ** 2 + for actual, ideal in zip(target, twice_ideal, strict=True)) + + +def within_radial_bound(source: Pair, target: Pair, num: int, den: int) -> bool: + """Compare the squared absolute norm change with num/den.""" + u = sum(value * value for value in source) + v = sum(value * value for value in target) + scaled_sum = den * (u + v) - num + return scaled_sum <= 0 or scaled_sum ** 2 <= 4 * den ** 2 * u * v + + +def check_case(period: int, cutoff: int) -> tuple[int, int]: + require(period % 4 == 0 and cutoff >= 5 and cutoff % 2 == 1, + "invalid period fixture") + require(period % cutoff != 0 and all(period % r == 0 for r in range(5, cutoff, 2)), + "fixture does not use the first incompatible ring") + count = period // 4 + radius = cutoff + 4 * (cutoff * (2 * count + 4) + 1) + cycles = [tangent_cycle(radius - 4, radius + 2 * j, j % 2 == 0) + for j in range(count)] + before = splice(cycles, 0) + after = splice(cycles, count - 1) + require(len(after) == period and set(after) == set(after.values()), + "edited orbits do not form a permutation") + require(orbit_length(cycles[0][0], after) == period, "incorrect least orbit period") + + changed = 0 + bound_num, bound_den = (4 * cutoff + 1) ** 2, 32 * cutoff ** 2 + for source, target in after.items(): + source_pair, target_pair = gaussian_pair(source), gaussian_pair(target) + require(four_times_error(source_pair, target_pair) == 4, "incorrect Gaussian error") + require(within_radial_bound(source_pair, target_pair, bound_num, bound_den), + "Gaussian edge exceeds the radial allowance") + changed += target != before[source] + require(changed == 2 * (count - 1), "incorrect count of switched successors") + return len(after), changed + + +def check_controls() -> None: + cycles = [tangent_cycle(177 - 4, 177 + 2 * j, j % 2 == 0) for j in range(3)] + start = cycles[0][0] + require(orbit_length(start, splice(cycles, 0)) == 4, "missing switches control failed") + require(orbit_length(start, splice(cycles, 1)) == 8, "skipped last switch control failed") + + same_side = splice(cycles, 1) + left, right = cycles[1][0], cycles[2][0] + same_side[left], same_side[right] = same_side[right], same_side[left] + require(four_times_error(gaussian_pair(right), gaussian_pair(same_side[right])) > 4, + "overlapping same-side switches should create a nonunit edge") + + axis_cycles = [tangent_cycle(1, 169, True), tangent_cycle(1, 171, False)] + axis_map = splice(axis_cycles, 1) + source = axis_cycles[0][0] + source_pair, target_pair = gaussian_pair(source), gaussian_pair(axis_map[source]) + require(four_times_error(source_pair, target_pair) == 4, "axis edge lost unit error") + require(not within_radial_bound(source_pair, target_pair, 16, 25), + "near-axis switch should exceed even the looser radial bound 4/5") + + +def main() -> None: + fixtures = ( + (4, 5), (8, 5), (12, 5), (16, 5), (20, 7), + (24, 5), (28, 5), (36, 5), (48, 5), (56, 5), + (60, 7), (72, 5), (84, 5), (140, 9), (180, 7), + (252, 5), (360, 7), (420, 9), (1260, 11), (13860, 13), + ) + edges = switched = 0 + for period, cutoff in fixtures: + checked_edges, changed_edges = check_case(period, cutoff) + edges += checked_edges + switched += changed_edges + check_controls() + print("PASS_GAUSSIAN_ROUNDER_EXACT_PERIOD") + print(f"{len(fixtures)} orbit fixtures; {edges} Gaussian edges; " + f"{switched} switched successors; 4 controls") + + +if __name__ == "__main__": + main() diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9")