From 7de4bd6bd4a6f7fae59b90c941ae5a3b9b3e652d Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 11 Nov 2026 13:32:12 +0000 Subject: [PATCH 1/2] feat(research): prove odd-budget helper channel capacity --- research/odd-budget-helper-capacity/PROOF.md | 129 +++++++++ research/odd-budget-helper-capacity/README.md | 93 ++++++ research/odd-budget-helper-capacity/SAFETY.md | 62 ++++ .../odd-budget-helper-capacity/SOURCES.json | 24 ++ research/odd-budget-helper-capacity/TASK.json | 133 +++++++++ .../odd-budget-helper-capacity/VERIFY.json | 34 +++ .../odd-budget-helper-capacity/capacity.py | 165 +++++++++++ research/odd-budget-helper-capacity/verify.py | 269 ++++++++++++++++++ 8 files changed, 909 insertions(+) create mode 100644 research/odd-budget-helper-capacity/PROOF.md create mode 100644 research/odd-budget-helper-capacity/README.md create mode 100644 research/odd-budget-helper-capacity/SAFETY.md create mode 100644 research/odd-budget-helper-capacity/SOURCES.json create mode 100644 research/odd-budget-helper-capacity/TASK.json create mode 100644 research/odd-budget-helper-capacity/VERIFY.json create mode 100644 research/odd-budget-helper-capacity/capacity.py create mode 100644 research/odd-budget-helper-capacity/verify.py diff --git a/research/odd-budget-helper-capacity/PROOF.md b/research/odd-budget-helper-capacity/PROOF.md new file mode 100644 index 0000000000..72debc5fd2 --- /dev/null +++ b/research/odd-budget-helper-capacity/PROOF.md @@ -0,0 +1,129 @@ +# Exact helper capacity with prescribed odd denominators + +This scoped algebraic result was produced by Nick Petalas. Apache-2.0. + +## Contract and theorem + +Let D=Z[1/2]. Let K be any finite m-by-n matrix over D. Fix positive odd +integers a,b. A t-channel boundary is a pair of rational matrices + +```text +X in Mat(t,m,Q), Y in Mat(n,t,Q), X K Y = I_t, +a X over D, b Y over D. +``` + +These are denominator divisibility budgets. They do not bound coefficient +magnitudes, dyadic precision, operation count or native availability. +In particular, a bound on the numerical size of a denominator is a different +contract. The t=0 boundary is allowed. + +Choose a normalized dyadic Smith chart + +```text +U K V = diag(h_1,...,h_r,0), +U in GL_m(D), V in GL_n(D), +0 < h_1 | h_2 | ... | h_r, all h_i odd. +``` + +Such a chart exists by the classical integer Smith theorem after clearing a +power-of-two denominator and absorbing powers of two into U. The factors h_i +are the positive odd parts of the ordinary integer Smith factors. + +**The maximum t is the number of h_i dividing ab.** By divisibility order +these are an initial segment. Equivalently, for 1 <= t <= r a t-channel +boundary exists exactly when h_t divides ab. For t>r it is impossible. + +Consequently, for 1 <= t <= r, the least positive odd q permitting qX and +qY over D is + +```text +q_t = product over odd primes p of p^ceil(v_p(h_t)/2). +``` + +More strongly, every feasible common q is a multiple of q_t. For t=0 use +q_0=1; for t>r no q works. With a dyadic suffix only, b=1, the exact +one-sided denominator requirement is h_t | a. With a=b=1 the theorem +reduces to Ali Romman's #5615 criterion. That case and Smith reduction +are credited predecessors, not new results here. + +## Attainment + +Let h_t divide ab and take the first t rows and columns of the Smith chart. +Define + +```text +X[i,:] = (b/h_i) U[i,:], +Y[:,i] = V[:,i]/b, 1 <= i <= t. +``` + +Then XKY=I_t entry by entry. Also aX has rows (ab/h_i)U[i,:], hence is +dyadic, and bY consists of columns of V. This constructs all channels +simultaneously. It needs no unproved lifting of a residue-ring solution. +The symmetric denominator formula follows by applying this construction +with a=b=q_t. + +## Necessity, including rectangular maps and prime powers + +Write A=aX and B=bY. The endpoint implies AKB=ab I_t. Substitute the +Smith chart and absorb its dyadic inverse factors into A and B. It suffices +to consider + +```text +A' S B' = ab I_t, S=diag(h_1,...,h_r,0), +A',B' over D. +``` + +The rational rank of S gives t<=r. Suppose h_t does not divide ab. Choose +an odd prime p with v_p(h_t)>e=v_p(ab), and let k be the number of h_i +with v_p(h_i)<=e. Divisibility order gives k None: + if not condition: + raise ValueError(message) + + +def matrix(rows: object) -> Matrix: + require(isinstance(rows, (list, tuple)), "matrix must be a list or tuple") + require(1 <= len(rows) <= MAX_DIMENSION, "matrix row capacity") + require(all(isinstance(row, (list, tuple)) for row in rows), "matrix rows") + width = len(rows[0]) + require(1 <= width <= MAX_DIMENSION, "matrix column capacity") + require(all(len(row) == width for row in rows), "ragged matrix") + values = [] + for row in rows: + converted = [] + for value in row: + require(type(value) in (int, Fraction), "exact rational entry required") + value = Fraction(value) + require(value.denominator & (value.denominator - 1) == 0, + "entry must be dyadic") + require(max(abs(value.numerator).bit_length(), + value.denominator.bit_length()) <= MAX_BITS, "entry capacity") + converted.append(value) + values.append(tuple(converted)) + return tuple(values) + + +def identity(size: int) -> Matrix: + require(type(size) is int and 0 <= size <= MAX_DIMENSION, "identity capacity") + return tuple(tuple(Fraction(i == j) for j in range(size)) for i in range(size)) + + +def multiply(left: Matrix, right: Matrix) -> Matrix: + require(bool(left) and bool(right), "nonempty matrix product required") + require(len(left[0]) == len(right), "matrix product shape") + return tuple(tuple(sum((left[i][k] * right[k][j] for k in range(len(right))), + Fraction(0)) for j in range(len(right[0]))) + for i in range(len(left))) + + +def determinant(value: Matrix) -> Fraction: + require(len(value) == len(value[0]), "square determinant required") + work = [list(row) for row in value] + result = Fraction(1) + for column in range(len(work)): + pivot = next((i for i in range(column, len(work)) if work[i][column]), None) + if pivot is None: + return Fraction(0) + if pivot != column: + work[pivot], work[column] = work[column], work[pivot] + result = -result + leading = work[column][column] + result *= leading + for i in range(column + 1, len(work)): + ratio = work[i][column] / leading + for j in range(column + 1, len(work)): + work[i][j] -= ratio * work[column][j] + return result + + +def is_unit(value: Fraction) -> bool: + numerator = abs(value.numerator) + denominator = value.denominator + return (numerator > 0 and numerator & (numerator - 1) == 0 + and denominator & (denominator - 1) == 0) + + +def validate_chart(k: Matrix, u: Matrix, v: Matrix, smith: tuple[int, ...]) -> None: + for value in (k, u, v): + require(matrix(value) == value, "invalid dyadic matrix") + m, n = len(k), len(k[0]) + require(len(u) == m and len(u[0]) == m, "left chart shape") + require(len(v) == n and len(v[0]) == n, "right chart shape") + require(type(smith) is tuple and len(smith) <= min(m, n), "Smith shape") + for i, factor in enumerate(smith): + require(type(factor) is int and 0 < factor <= MAX_ODD and factor % 2 == 1, + "Smith factors must be bounded positive odd integers") + require(i == 0 or factor % smith[i - 1] == 0, "Smith divisibility") + require(is_unit(determinant(u)) and is_unit(determinant(v)), "nonunit chart") + expected = tuple(tuple(Fraction(smith[i] if i == j and i < len(smith) else 0) + for j in range(n)) for i in range(m)) + require(multiply(multiply(u, k), v) == expected, "false Smith identity") + + +def budget(value: int) -> None: + require(type(value) is int and 0 < value <= MAX_ODD and value % 2 == 1, + "budget must be a bounded positive odd integer") + + +def factors(value: int) -> tuple[tuple[int, int], ...]: + budget(value) + remaining = value + result = [] + for prime in range(3, isqrt(value) + 1, 2): + exponent = 0 + for _ in range(20): + if remaining % prime: + break + remaining //= prime + exponent += 1 + if exponent: + result.append((prime, exponent)) + if remaining > 1: + result.append((remaining, 1)) + return tuple(result) + + +def valuation(value: int, prime: int) -> int: + require(type(value) is int and 0 < value < 1 << 40, "valuation input") + require(type(prime) is int and 3 <= prime <= MAX_ODD, "valuation divisor") + for exponent in range(41): + if value % prime: + return exponent + value //= prime + raise ValueError("valuation capacity") + + +def construct(k: Matrix, u: Matrix, v: Matrix, smith: tuple[int, ...], + a: int, b: int) -> tuple[Matrix, Matrix, int, tuple[int, int] | None]: + validate_chart(k, u, v, smith) + budget(a) + budget(b) + count = sum(a * b % factor == 0 for factor in smith) + x = tuple(tuple(Fraction(b, smith[i]) * value for value in u[i]) + for i in range(count)) + y = tuple(tuple(v[j][i] / b for i in range(count)) for j in range(len(v))) + obstruction = None + if count < len(smith): + for prime, exponent in factors(smith[count]): + if exponent > valuation(a * b, prime): + obstruction = (prime, valuation(a * b, prime)) + break + require(obstruction is not None, "missing prime obstruction") + return x, y, count, obstruction + + +def common_denominator(smith: tuple[int, ...], count: int) -> int | None: + require(type(count) is int and 0 <= count <= MAX_DIMENSION + 1, + "channel count capacity") + require(type(smith) is tuple and len(smith) <= MAX_DIMENSION, "Smith capacity") + for i, factor in enumerate(smith): + budget(factor) + require(i == 0 or factor % smith[i - 1] == 0, "Smith divisibility") + if count > len(smith): + return None + result = 1 + if count: + for prime, exponent in factors(smith[count - 1]): + result *= prime ** ((exponent + 1) // 2) + return result diff --git a/research/odd-budget-helper-capacity/verify.py b/research/odd-budget-helper-capacity/verify.py new file mode 100644 index 0000000000..2af7785b44 --- /dev/null +++ b/research/odd-budget-helper-capacity/verify.py @@ -0,0 +1,269 @@ +"""Independent finite corroboration of the new odd-budget boundary contract. + +Produced by Nick Petalas. Apache-2.0. Writes only its computed stdout receipt. +""" + +import hashlib +import itertools +import json +from fractions import Fraction +from pathlib import Path + +import capacity as candidate + + +def check(condition: bool, message: str) -> None: + if not condition: + raise AssertionError(message) + + +def inverse(value: candidate.Matrix) -> candidate.Matrix: + size = len(value) + work = [list(row) + list(candidate.identity(size)[i]) for i, row in enumerate(value)] + for column in range(size): + pivot = next(i for i in range(column, size) if work[i][column]) + work[column], work[pivot] = work[pivot], work[column] + scale = work[column][column] + work[column] = [entry / scale for entry in work[column]] + for row in range(size): + if row != column: + scale = work[row][column] + work[row] = [a - scale * b for a, b in zip(work[row], work[column], strict=True)] + check(all(work[i][:size] == list(candidate.identity(size)[i]) for i in range(size)), + "inverse elimination failed") + return tuple(tuple(row[size:]) for row in work) + + +def chart(smith: tuple[int, ...], serial: int) -> tuple[candidate.Matrix, ...]: + m, n = len(smith) + 1, len(smith) + 2 + changes = [] + for size in (m, n): + work = [list(row) for row in candidate.identity(size)] + for index in range(size - 1): + coefficient = (serial + index) % 5 - 2 + work[index] = [a + coefficient * b + for a, b in zip(work[index], work[index + 1], strict=True)] + work[-1] = [entry * Fraction(1, 2) for entry in work[-1]] + changes.append(tuple(tuple(row) for row in work)) + u, v = changes + diagonal = tuple(tuple(Fraction(smith[i] if i == j and i < len(smith) else 0) + for j in range(n)) for i in range(m)) + k = candidate.multiply(candidate.multiply(inverse(u), diagonal), inverse(v)) + return k, u, v + + +def witness_ok(k: candidate.Matrix, x: candidate.Matrix, y: candidate.Matrix, + count: int, a: int, b: int) -> bool: + if len(x) != count or len(y) != len(k[0]): + return False + if any(len(row) != len(k) for row in x) or any(len(row) != count for row in y): + return False + for rows, scale in ((x, a), (y, b)): + for row in rows: + for entry in row: + denominator = (scale * entry).denominator + if denominator & (denominator - 1): + return False + for i in range(count): + for j in range(count): + entry = sum((x[i][s] * k[s][t] * y[t][j] + for s in range(len(k)) for t in range(len(k[0]))), Fraction(0)) + if entry != int(i == j): + return False + return True + + +def chart_cases() -> dict[str, int | list[int]]: + profiles = [()] + profiles.extend((a,) for a in (1, 3, 5)) + profiles.extend((a, a * b) for a in (1, 3, 5) for b in (1, 3, 5, 9)) + profiles.extend((a, a * b, a * b * c) for a in (1, 3, 5) + for b in (1, 3, 5, 9) for c in (1, 3, 5, 9)) + profiles.append((1, 27, 675)) + cases = 0 + obstructions = 0 + for serial, smith in enumerate(profiles): + k, u, v = chart(smith, serial) + for a, b in itertools.product((1, 3, 5, 9, 15, 25), repeat=2): + x, y, count, obstruction = candidate.construct(k, u, v, smith, a, b) + check(witness_ok(k, x, y, count, a, b), "non-diagonal boundary witness") + if obstruction: + prime, exponent = obstruction + local_count = sum(h % (prime ** (exponent + 1)) != 0 for h in smith) + check(local_count == count, "prime-local upper certificate") + obstructions += 1 + else: + check(count == len(smith), "rational-rank upper certificate") + cases += 1 + for count in range(len(smith) + 1): + q = candidate.common_denominator(smith, count) + x, y, achieved, _ = candidate.construct(k, u, v, smith, q, q) + check(achieved >= count and witness_ok(k, x, y, achieved, q, q), + "least common denominator attainer") + if count: + for prime, _ in candidate.factors(q): + _, _, fewer, _ = candidate.construct(k, u, v, smith, q // prime, q // prime) + check(fewer < count, "common denominator prime is indispensable") + check(candidate.common_denominator(smith, len(smith) + 1) is None, + "above-rank common denominator") + minima = [candidate.common_denominator((1, 27, 675), t) for t in (1, 2, 3)] + check(minima == [1, 9, 45], "prime-power example") + return {"profiles": len(profiles), "budget_cases": cases, + "prime_obstructions": obstructions, "example_minima": minima} + + +def factor_exists(k: tuple[tuple[int, int], tuple[int, int]], scalar: int, + width: int, modulus: int) -> tuple[bool, int, int]: + """Brute-force every right factor, then every possible left row modulo 9.""" + right_count = 0 + row_count = 0 + targets = [tuple(scalar * int(i == j) % modulus for j in range(width)) + for i in range(width)] + for flat in itertools.product(range(modulus), repeat=2 * width): + right_count += 1 + right = (flat[:width], flat[width:]) + middle = tuple(tuple(sum(k[i][s] * right[s][j] for s in range(2)) % modulus + for j in range(width)) for i in range(2)) + image = set() + for left in itertools.product(range(modulus), repeat=2): + image.add(tuple(sum(left[s] * middle[s][j] for s in range(2)) % modulus + for j in range(width))) + row_count += 1 + if all(target in image for target in targets): + return True, right_count, row_count + return False, right_count, row_count + + +def residue_cases() -> dict[str, int]: + systems = 0 + right_count = 0 + row_count = 0 + for d0, d1 in itertools.combinations_with_replacement((1, 3, 9), 2): + for changed in range(3): + k = ((d0, changed * d0), ((changed + 1) * d0, + (changed + 1) * changed * d0 + d1)) + for scalar in (1, 3): + expected = sum(scalar % d == 0 for d in (d0, d1)) + for width in (1, 2): + exists, rights, rows = factor_exists(k, scalar, width, 9) + check(exists == (width <= expected), "independent residue-ring existence") + systems += 1 + right_count += rights + row_count += rows + check(not factor_exists(((1, 0), (0, 9)), 3, 2, 9)[0], + "determinant-only false positive") + return {"systems": systems, "right_factors_enumerated": right_count, + "left_rows_enumerated": row_count, "determinant_control": 1} + + +def scalar_cases() -> dict[str, int]: + cases = 0 + pairs = 0 + for prime in (3, 5): + for power in range(5): + for exponent in range(3): + modulus = prime ** (exponent + 1) + scalar = prime ** exponent + found = False + for left, right in itertools.product(range(modulus), repeat=2): + pairs += 1 + if (left * prime ** power * right - scalar) % modulus == 0: + found = True + check(found == (power <= exponent), "complete scalar prime-power search") + cases += 1 + return {"systems": cases, "factor_pairs_enumerated": pairs} + + +def symmetric_cases() -> dict[str, int]: + pairs = 0 + for factor in range(1, 256, 2): + feasible = [] + for q in range(1, factor + 1, 2): + if q * q % factor == 0: + feasible.append(q) + pairs += 1 + predicted = candidate.common_denominator((factor,), 1) + check(predicted == min(feasible), "independent least common denominator") + check(all(q % predicted == 0 for q in feasible), "all feasible denominators divide") + largest = 1 << 255 + k = candidate.matrix([[largest]]) + u = candidate.matrix([[Fraction(1, largest)]]) + v = candidate.identity(1) + x, y, count, _ = candidate.construct(k, u, v, (1,), candidate.MAX_ODD, candidate.MAX_ODD) + check(witness_ok(k, x, y, count, candidate.MAX_ODD, candidate.MAX_ODD), + "inclusive bit and budget capacities") + k = tuple(tuple(Fraction(i == j and i < 1) for j in range(6)) for i in range(6)) + x, y, count, _ = candidate.construct(k, candidate.identity(6), candidate.identity(6), + (1,), 1, 1) + check(witness_ok(k, x, y, count, 1, 1), "inclusive dimension capacity") + return {"odd_factors": 128, "denominator_candidates": pairs, "capacity_positives": 2} + + +def expect_rejection(function, *arguments) -> None: + try: + function(*arguments) + except (ValueError, TypeError): + return + raise AssertionError("invalid contract accepted") + + +def controls() -> dict[str, int]: + k, u, v = chart((1, 27, 675), 2) + invalid_budgets = (0, -1, 2, True, (1 << 21) + 1) + for value in invalid_budgets: + expect_rejection(candidate.construct, k, u, v, (1, 27, 675), value, 1) + for smith in ((3, 1), (0,), (2,), ((1 << 21) + 1,)): + expect_rejection(candidate.construct, k, u, v, smith, 1, 1) + altered = tuple(tuple(value + int(i == 0 and j == 0) for j, value in enumerate(row)) + for i, row in enumerate(k)) + expect_rejection(candidate.construct, altered, u, v, (1, 27, 675), 1, 1) + bad_u = tuple(tuple(value * (3 if i == 0 else 1) for value in row) + for i, row in enumerate(u)) + expect_rejection(candidate.construct, k, bad_u, v, (1, 27, 675), 1, 1) + bad_matrices = ([[Fraction(1, 3)]], [[True]], [[1], [1, 2]], [], [[1 << 256]], + [[1] * 7], [[1]] * 7) + for value in bad_matrices: + expect_rejection(candidate.matrix, value) + expect_rejection(candidate.common_denominator, (1,) * 7, 1) + expect_rejection(candidate.common_denominator, (1,), -1) + x, y, count, _ = candidate.construct(k, u, v, (1, 27, 675), 9, 75) + check(witness_ok(k, x, y, count, 9, 75), "positive witness control") + bad_x = tuple(tuple(value + int(i == 0 and j == 0) for j, value in enumerate(row)) + for i, row in enumerate(x)) + check(not witness_ok(k, bad_x, y, count, 9, 75), "changed boundary coefficient") + check(not witness_ok(k, x, y[:-1], count, 9, 75), "missing suffix row") + check(not witness_ok(k, x, y, count, 1, 75), "undeclared left odd division") + return {"rejections": len(invalid_budgets) + 4 + 2 + len(bad_matrices) + 2 + 3, + "positive_witnesses": 1} + + +def authenticate() -> dict[str, str]: + package = Path(__file__).resolve().parent + root = package.parent.parent + sources = json.loads((package / "SOURCES.json").read_text()) + hashes = {} + for row in sources["files"]: + if row["usage"] == "input": + path = root / row["path"] + digest = hashlib.sha256(path.read_bytes()).hexdigest() + check(digest == row["sha256"], "live predecessor proof drift") + hashes[row["path"]] = digest + names = ("README.md", "PROOF.md", "SAFETY.md", "TASK.json", "SOURCES.json", + "VERIFY.json", "capacity.py", "verify.py") + for name in names: + hashes[name] = hashlib.sha256((package / name).read_bytes()).hexdigest() + return hashes + + +def main() -> None: + hashes = authenticate() + receipt = {"status": "PASS_ODD_BUDGET_HELPER_CAPACITY", "source_sha256": hashes, + "charts": chart_cases(), "residue_ring": residue_cases(), + "scalar_prime_powers": scalar_cases(), "common_denominators": symmetric_cases(), + "controls": controls(), + "scope": "Scoped algebraic proof with finite corroboration; no supplier or kappa."} + print(json.dumps(receipt, indent=2, sort_keys=True)) + + +if __name__ == "__main__": + main() From d0a117961c7a1d34476e2662ebe6c974612fab32 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:55:00 +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")