From 31ad84175608f0d90736f6423f5fa1e5a957d207 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:25:32 +0000 Subject: [PATCH 1/2] feat(research): certify Gaussian rounding through radius 24 --- research/gaussian-outward-radius24/README.md | 138 ++++++++++ .../gaussian-outward-radius24/SOURCES.json | 18 ++ research/gaussian-outward-radius24/TASK.json | 89 ++++++ .../gaussian-outward-radius24/VERIFY.json | 34 +++ research/gaussian-outward-radius24/verify.py | 255 ++++++++++++++++++ 5 files changed, 534 insertions(+) create mode 100644 research/gaussian-outward-radius24/README.md create mode 100644 research/gaussian-outward-radius24/SOURCES.json create mode 100644 research/gaussian-outward-radius24/TASK.json create mode 100644 research/gaussian-outward-radius24/VERIFY.json create mode 100644 research/gaussian-outward-radius24/verify.py diff --git a/research/gaussian-outward-radius24/README.md b/research/gaussian-outward-radius24/README.md new file mode 100644 index 0000000000..01c06b4372 --- /dev/null +++ b/research/gaussian-outward-radius24/README.md @@ -0,0 +1,138 @@ +# Exact forward Gaussian rounding threshold through radius 24 + +For the normalized four-coordinate Hadamard transform \(U=H/2\), put +\[ +H=\begin{pmatrix} +1&1&1&1\\ +1&-1&1&-1\\ +1&1&-1&-1\\ +1&-1&-1&1 +\end{pmatrix},\qquad +S_R=\{x\in\mathbb Z^4:\|x\|_2\le R\}. +\] +An admissible map is an injection \(F:S_R\to\mathbb Z^4\) with +\(\|F(x)-Ux\|_2\le1\) at every input. Its forward slack is +\(\max_x(\|F(x)\|_2-\|x\|_2)\). + +**New finite certificate.** On \(S_{24}\), an admissible map exists with +forward slack at most \(\beta=\sqrt{78}-\sqrt{73}\). The verifier constructs +and checks an integral flow that saturates all **1,638,241** inputs. + +Jerry Chen's [PR #7571](https://github.com/CrocSwap/integer-mult-bounds/pull/7571) +proves the lower bound \(\beta\) at radius 9. With that lower bound, restriction +of the radius-24 injection gives the exact optimum \(\beta\) at every real +radius \(9\le R\le24\). In particular, the radii above 11 left open in that +work have the same optimum through 24. The new check establishes the +radius-24 upper bound. It uses the earlier lower bound as a cited premise. + +For Ali Romman's [ideal Gaussian pair in #6509](https://github.com/CrocSwap/integer-mult-bounds/pull/6509), +write \(C_+(x,y)=((x+y+i(x-y))/2,(x+y-i(x-y))/2)\) in real-coordinate order +\((\Re x,\Im x,\Re y,\Im y)\). With \(S=\operatorname{diag}(1,-1,1,1)\) +and \(L(a,b,c,d)=(a,c,-d,b)\), the identity \(U=LC_+S\) transfers +the certificate as \(L^{-1}FS\). Both signed permutations are lattice +bijections that preserve Euclidean norms. + +## Why the flow proves an injection + +**Candidates.** Every coordinate of \(Hx\) has the same parity as the sum of +the coordinates of \(x\). When that sum is even, integer outputs within +distance one of \(Ux\) are its center and eight signed unit translations. When the +sum is odd, each coordinate is half-integral. The 16 corners from the two +nearest integers in each coordinate are all at distance one. Any other output +has some coordinate at distance at least \(3/2\). + +**Orbits.** Use the even-sign signed permutations \(G\) of four coordinates. +They are generated by reflections in the normals \(e_i-e_j\) and \(e_i+e_j\). +The former swap two coordinates and the latter swap and negate them. Under +conjugation by \(U\), each of these normals maps to another vector with +exactly two nonzero entries, both \(\pm1\). This follows because distinct +Hadamard columns agree at two positions and disagree at two. Consequently +\(UGU^T=G\). The paired action \((x,y)\mapsto(Ax,UAU^Ty)\) preserves +the error and both radii. + +An orbit is determined by its sorted absolute coordinates and, if none +are zero, its sign product. A zero allows an extra sign flip without moving +the point. For multiplicities \(m_a\) of each absolute coordinate, the orbit +size is +\[ +\frac{4!}{\prod_a m_a!}\;2^{\min(3,4-m_0)}. +\] +Running the candidate rule on one representative gives the complete list +of incident output orbits. The graph has 11,383 input orbits and 11,661 +output orbits incident to at least one allowed edge. + +**Exact gap.** If \(m=\|y\|_2^2\le n=\|x\|_2^2\), the edge is +allowed. For \(m>n\), put \(d=m-n\) and \(t=\beta^2\). Because +\(0<\beta<1\), we have \(d>t\). Squaring the equivalent comparison +\(d-t\le2\sqrt{nt}\) gives +\[ +t^2-(2d+4n)t+d^2\le0. +\] +Substituting \(t=151-2\sqrt{5694}\) gives \(p+q\sqrt{5694}\le0\) +for integer \(p,q\). Their signs determine when it is valid to compare the +squares. This preserves equality at the threshold. + +**Lift.** The witness has a nonnegative integer amount for each used +orbit pair. The checker tests adjacency, outgoing sum equal to input orbit +size, and incoming sum at most output orbit size. For a pair of orbits +\(I,O\), distribute its amount uniformly over the actual edges from \(I\) +to \(O\). Transitivity makes that bipartite subgraph biregular. Hence +each input vertex gets total weight one and each output vertex gets +total weight at most one. For any input subset, its total outgoing weight +is its cardinality and fits within its neighborhood's cardinality. +Hall's theorem gives an injection on the full ball. + +## Reproduction + +From the repository root with CPython 3.12 and its standard library: + +```sh +python3.12 -I -W error -B research/gaussian-outward-radius24/verify.py +python3.12 -I -O -W error -B research/gaussian-outward-radius24/verify.py +python3.12 -B scripts/research_package.py --package research/gaussian-outward-radius24 +python3.12 -B scripts/check_research_commit.py --package research/gaussian-outward-radius24 --check-source-history +``` + +Both direct modes report `PASS_GAUSSIAN_OUTWARD_RADIUS24` with +21,458 positive orbit flows. The replay recomputes the witness and checks +it independently of the flow solver's saturation report. A separate +integer count slices the ball along the fourth coordinate. Controls +check equality and a larger gap at the threshold, reject invalid flows, +and exercise a residual path that reroutes an earlier assignment. + +Replay is read-only and needs no external data. Its managed storage is +bounded by the fixed radius. Each of at most \(2\binom{28}{4}\) input orbit +keys has at most 16 candidate edges, and each output coordinate has +magnitude at most 25. The bounded residual search uses integer capacities. +The predecessor lower bound and signed-permutation transfer are written +proof dependencies. The replay does not run predecessor verifiers. + +## Scope and credit + +The finite certificate leaves all-lattice attainment, exact-sum and phase +identities, physical rounder costs, and selected caller admission open. +It yields no new \(\kappa\). The `uniform-transfer-audit` card changes from +an actual-caller implication to a finite precision-contract question. The +selected baseline check was metadata orientation. + +This contribution was produced by Nick Petalas. Credit Jerry Chen for +[the finite Hall and orbit-flow result at exact head +`3c7c3e8000f592fd9adecb44008ff6d5ae5d453d`](https://github.com/CubeJerry/integer-mult-bounds/blob/3c7c3e8000f592fd9adecb44008ff6d5ae5d453d/research/sharp-finite-gaussian-outward-slack/orbit-extension/PROOF.md) +and for the larger-radius question. Credit Ali Romman for the Gaussian +pair and same-grid inverse in #6509, ywz65 for the +[finite-ball rounding boundary in #2589](https://github.com/CrocSwap/integer-mult-bounds/pull/2589), +and Nick Petalas for the +[zero-slack obstruction in #6619](https://github.com/CrocSwap/integer-mult-bounds/pull/6619). +The classical finite matching argument retains its usual attribution. +[Advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19693299). + +## Open next questions + +- Does the same threshold admit an injection on the entire lattice? A + radius-independent argument for Hall cuts would suffice by compactness + because every input has a finite neighbor set. The present result + controls only subsets inside the certified balls. +- Can an attained global forward bound coexist with exact sum or a + caller's phase identity? Begin by restricting the candidate edges to + a named caller's required invariants and identifying the resulting cuts. + The unrestricted graph does not encode these requirements. diff --git a/research/gaussian-outward-radius24/SOURCES.json b/research/gaussian-outward-radius24/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/gaussian-outward-radius24/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-outward-radius24/TASK.json b/research/gaussian-outward-radius24/TASK.json new file mode 100644 index 0000000000..77ce917f6c --- /dev/null +++ b/research/gaussian-outward-radius24/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": "Certify attainment of the known forward slack threshold for injective error-one Hadamard/Gaussian rounding on the radius-24 lattice ball.", + "scope_change_reason": "PR #7571 leaves radii above 11 open. This finite rounding question isolates a precision contract with no selected-caller binding.", + "bottleneck_link": "Side result on outward norm slack under same-grid injectivity. Supplier cost and caller admission remain separate.", + "budget_minutes": 60, + "stop_rule": "Stop at the first stronger certified finite result and record the all-lattice question as open.", + "outcome": "completed", + "evidence": "Exact integral orbit flow saturates all 1638241 input points at sqrt(78)-sqrt(73). The cited PR #7571 lower bound gives equality for every radius from 9 through 24.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Does the same threshold admit an injection on the entire lattice?", + "why_it_matters": "It would close the gap between the finite forward lower bound and the global constructive upper bound.", + "first_step": "Find a radius-independent bound on the forward Hall cuts in this local graph.", + "blocked_by": "A uniform extension argument for the finite flow remains open." + }, + { + "question": "Can a rounder at the optimum also preserve the invariants of a concrete Gaussian caller?", + "why_it_matters": "An injective rounding certificate alone is insufficient for a native caller.", + "first_step": "Restrict the candidate edges to one caller's exact sums or phase conditions and assess the new Hall cuts.", + "blocked_by": "The unrestricted graph omits caller constraints and restoration costs." + } + ] +} diff --git a/research/gaussian-outward-radius24/VERIFY.json b/research/gaussian-outward-radius24/VERIFY.json new file mode 100644 index 0000000000..427fd19fe1 --- /dev/null +++ b/research/gaussian-outward-radius24/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": 60, + "checks": "Exact radius-24 orbit flow, witness constraints, complete input count and negative controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Exact radius-24 orbit flow, witness constraints, complete input count and negative controls." + } + ] +} diff --git a/research/gaussian-outward-radius24/verify.py b/research/gaussian-outward-radius24/verify.py new file mode 100644 index 0000000000..7929bc2abf --- /dev/null +++ b/research/gaussian-outward-radius24/verify.py @@ -0,0 +1,255 @@ +"""Construct and check an exact orbit flow for the radius-24 rounding graph.""" + +from collections import Counter +from dataclasses import dataclass +from itertools import combinations_with_replacement, product +from math import factorial, isqrt, prod + +Point = tuple[int, int, int, int] + +RADIUS = 24 +TOP = 78 +BOTTOM = 73 + + +def squared_norm(point: Point) -> int: + return sum(coordinate * coordinate for coordinate in point) + + +def orbit_key(point: Point) -> Point: + a, b, c, d = sorted(map(abs, point)) + return (-a if prod(point) < 0 else a, b, c, d) + + +def orbit_size(point: Point) -> int: + counts = Counter(map(abs, point)) + permutations = 24 // prod(factorial(count) for count in counts.values()) + return permutations * 2 ** min(3, 4 - counts[0]) + + +def input_orbits() -> dict[Point, int]: + orbits = {} + for point in combinations_with_replacement(range(RADIUS + 1), 4): + if squared_norm(point) <= RADIUS**2: + orbits[point] = orbit_size(point) + if point[0] != 0: + a, b, c, d = point + orbits[-a, b, c, d] = orbit_size(point) + return orbits + + +def rounded_neighbors(point: Point) -> list[Point]: + a, b, c, d = point + twice = (a + b + c + d, a - b + c - d, a + b - c - d, a - b - c + d) + low = tuple(entry // 2 for entry in twice) + if twice[0] % 2: + return list(product(*[(entry, entry + 1) for entry in low])) + neighbors = [low] + for axis in range(4): + for step in (-1, 1): + shifted = list(low) + shifted[axis] += step + neighbors.append(tuple(shifted)) + return neighbors + + +def allowed_gap(output_norm: int, input_norm: int) -> bool: + """Compare sqrt(output_norm) - sqrt(input_norm) with sqrt(78) - sqrt(73).""" + delta = output_norm - input_norm + if delta <= 0: + return True + total = TOP + BOTTOM + radicand = TOP * BOTTOM + linear = 2 * delta + 4 * input_norm + # Substitute t = total - 2*sqrt(radicand) into t*t - linear*t + delta*delta. + p = total**2 + 4 * radicand - linear * total + delta**2 + q = 2 * linear - 4 * total + if q > 0: + return p < 0 and p**2 >= q**2 * radicand + if q < 0: + return p <= 0 or p**2 <= q**2 * radicand + return p <= 0 + + +@dataclass +class Edge: + target: int + back: int + room: int + + +def connect(graph: list[list[Edge]], start: int, end: int, capacity: int) -> Edge: + forward = Edge(end, len(graph[end]), capacity) + reverse = Edge(start, len(graph[start]), 0) + graph[start].append(forward) + graph[end].append(reverse) + return reverse + + +def levels_from(graph: list[list[Edge]], source: int) -> list[int]: + levels = [-1] * len(graph) + levels[source] = 0 + queue = [source] + cursor = 0 + for _ in range(len(graph)): + if cursor == len(queue): + break + vertex = queue[cursor] + cursor += 1 + for edge in graph[vertex]: + if edge.room > 0 and levels[edge.target] == -1: + levels[edge.target] = levels[vertex] + 1 + queue.append(edge.target) + return levels + + +def augment( + graph: list[list[Edge]], + levels: list[int], + next_edge: list[int], + source: int, + sink: int, + arc_count: int, +) -> int: + """Send flow along one admissible path, or mark the level graph blocked.""" + vertex = source + path = [] + for _ in range(2 * arc_count + 1): + if vertex == sink: + amount = min(graph[node][offset].room for node, offset in path) + for node, offset in path: + edge = graph[node][offset] + edge.room -= amount + graph[edge.target][edge.back].room += amount + return amount + for offset in range(next_edge[vertex], len(graph[vertex])): + edge = graph[vertex][offset] + if edge.room > 0 and levels[edge.target] == levels[vertex] + 1: + next_edge[vertex] = offset + path.append((vertex, offset)) + vertex = edge.target + break + else: + levels[vertex] = -1 + if not path: + return 0 + vertex, offset = path.pop() + next_edge[vertex] = offset + 1 + raise RuntimeError("level path exceeded its arc bound") + + +def send_flow(graph: list[list[Edge]], source: int, sink: int, demand: int) -> int: + arc_count = sum(map(len, graph)) + sent = 0 + for _ in range(len(graph) - 1): + levels = levels_from(graph, source) + if levels[sink] < 0: + return sent + next_edge = [0] * len(graph) + for _ in range(arc_count): + added = augment(graph, levels, next_edge, source, sink, arc_count) + if added == 0: + break + sent += added + if sent == demand: + return sent + else: + raise RuntimeError("blocking flow exceeded its arc bound") + raise RuntimeError("flow exceeded its distance bound") + + +def make_witness(inputs: dict[Point, int]) -> tuple[list[tuple[Point, Point, int]], int]: + outputs = {} + pairs = [] + left_count = len(inputs) + for row, (point, capacity) in enumerate(inputs.items()): + input_norm = squared_norm(point) + for target in sorted({orbit_key(output) for output in rounded_neighbors(point)}): + if allowed_gap(squared_norm(target), input_norm): + column = outputs.setdefault(target, left_count + len(outputs)) + pairs.append((row, column, point, target, capacity)) + source = left_count + len(outputs) + sink = source + 1 + graph = [[] for _ in range(sink + 1)] + arcs = [ + (point, target, connect(graph, row, column, capacity)) + for row, column, point, target, capacity in pairs + ] + for row, capacity in enumerate(inputs.values()): + connect(graph, source, row, capacity) + for target, column in outputs.items(): + connect(graph, column, sink, orbit_size(target)) + demand = sum(inputs.values()) + sent = send_flow(graph, source, sink, demand) + if sent != demand: + raise ValueError(f"flow sends {sent} of {demand} required units") + return [(point, target, back.room) for point, target, back in arcs if back.room], len(outputs) + + +def check_witness(inputs: dict[Point, int], witness: list[tuple[Point, Point, int]]) -> None: + used_left = Counter() + used_right = Counter() + for point, target, amount in witness: + if point not in inputs or not 0 < amount <= inputs[point]: + raise ValueError("invalid input orbit or amount") + if target not in {orbit_key(output) for output in rounded_neighbors(point)}: + raise ValueError("flow uses a forbidden rounding edge") + if not allowed_gap(squared_norm(target), squared_norm(point)): + raise ValueError("flow exceeds the outward gap") + used_left[point] += amount + used_right[target] += amount + if used_left != inputs: + raise ValueError("flow leaves an input orbit unsaturated") + if any(used > orbit_size(target) for target, used in used_right.items()): + raise ValueError("flow exceeds an output capacity") + + +def check_controls() -> None: + if not allowed_gap(78, 73) or allowed_gap(79, 73): + raise ValueError("exact threshold boundary failed") + if not allowed_gap(73, 78) or allowed_gap(2, 1): + raise ValueError("gap sign control failed") + point = (0, 0, 0, 0) + check_witness({point: 1}, [(point, point, 1)]) + unit = (0, 0, 0, 1) + bad_witnesses = ( + ({point: 1}, []), + ({point: 1}, [(point, (0, 0, 0, 2), 1)]), + ({point: 1}, [(point, point, 2)]), + ({point: 1, unit: 1}, [(point, point, 1), (unit, point, 1)]), + ) + for inputs, bad in bad_witnesses: + try: + check_witness(inputs, bad) + except ValueError: + continue + raise ValueError("witness checker accepted an invalid flow") + # A direct greedy pass strands vertex 1. A residual path reroutes vertex 0. + graph = [[] for _ in range(6)] + for start, end in [(4, 0), (4, 1), (0, 2), (0, 3), (1, 2), (2, 5), (3, 5)]: + connect(graph, start, end, 1) + if send_flow(graph, 4, 5, 2) != 2: + raise ValueError("flow failed on the rerouting control") + + +def main() -> None: + check_controls() + inputs = input_orbits() + witness, output_count = make_witness(inputs) + check_witness(inputs, witness) + total = sum(inputs.values()) + # Count integral points independently by slicing in the fourth coordinate. + interval = range(-RADIUS, RADIUS + 1) + ball_count = 0 + for a, b, c in product(interval, repeat=3): + remainder = RADIUS**2 - a * a - b * b - c * c + if remainder >= 0: + ball_count += 2 * isqrt(remainder) + 1 + if total != ball_count or total != 1_638_241: + raise ValueError("input orbit cover disagrees with the ball count") + print(f"PASS_GAUSSIAN_OUTWARD_RADIUS24 inputs={total} left_orbits={len(inputs)} " + f"right_orbits={output_count} positive_flows={len(witness)} gap=sqrt(78)-sqrt(73)") + + +if __name__ == "__main__": + main() From 4bcd4ecd13647798baa7ee6b95dd5e48ef1319ed Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:28:21 +0000 Subject: [PATCH 2/2] fix(ci): sync CI verification doc and historical replay-gap verifier --- docs/ci-verification.md | 19 +++++- .../historical-selected-replay-gap/README.md | 6 +- .../SOURCES.json | 60 +++++++++--------- .../VERIFY.json | 31 +-------- .../historical-selected-replay-gap/verify.py | 63 ++++++++++++++----- 5 files changed, 100 insertions(+), 79 deletions(-) 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/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")