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/fused-negative-half-tape/README.md b/research/fused-negative-half-tape/README.md new file mode 100644 index 0000000000..9247121f8b --- /dev/null +++ b/research/fused-negative-half-tape/README.md @@ -0,0 +1,159 @@ +# Fuse negation into the marked-tape negative half + +A fixed reversible table computes and reverses the negative stochastic half +in at most **`4W+1` local transitions per direction** for every signed width +`W >= 2`. The bound is attained at `x=0` with either resident coin value. +This is a scoped written proof with exact finite corroboration. It reduces +the `6W+2` worst case reported by ToikY's #6809 under the same six-glyph tape, +parity, coin and head-return contract. It uses 35 coin-expanded rows per +direction. [Prior negative-half construction and transition bound][negative] + +## Contract + +Write `x=2q+p` with `q=floor(x/2)` and `p` in `{0,1}`. For a resident +read-only coin `u`, zxv's #6092 convention gives + +```text +S(n,2,u) = floor(n/2) + [u < n mod 2] +S(-x,2,u) = -q-pu = ~q + (1-pu) +``` + +Here `~q=-q-1` is the signed two's-complement complement. The work head +starts at the clean parity marker in `P0 b0 ... b_(W-2) S(b_(W-1))`, with +the value in little-endian order. The forward call writes `S(-x,2,u)` in +the same layout and retains `Pp`. The inverse restores the original +`x` and `P0`. Both heads return. The work interval is exactly `W+1` cells +including parity, plus one stationary coin cell on a second tape. The +table uses the glyphs `0,1,P0,P1,S0,S1` and no additional working cells. + +The directional entry and return states are `F0/FH` and `I0/IH`. Each +row reads one work glyph and the stationary coin, writes one work glyph +and moves the work head by at most one cell. The table supplies each row +explicitly, with `*` expanding to the two coin values. The coin is read +only. All calls stay inside the declared interval, so arbitrary exterior +cells retain their contents. [Literal table](TABLE.txt) + +## Forward proof + +Follow #6801's marked right shift. Scan to the marked sign, store its +original bit in control and write the complementary sign bit. On the +leftward pass each interior cell receives the complement of the carried +bit from its right. Its original bit becomes the new carry. Thus the +pass writes `~q` across all `W` value cells. Upon reaching the parity +marker, the carried original low bit `p` is written into `Pp`. +[Positive marked-shift construction][positive] + +When `e=1-pu` is one, the table ripples an increment through the low +ones of `~q`. It visits the first zero or the marked sign, whichever +comes first, flips that bit and returns over the zeros it just wrote. +When `e=0`, the parity write also halts. The result is +`~q+e=-q-pu`. Both `~q` and `~q+e` fit in signed width `W`, since +`-2^(W-2) <= q <= 2^(W-2)-1`. The ripple agrees with signed addition, +including the all-ones word becoming zero. + +## Inverse proof + +On a canonical inverse entrance `(y,Pp,u)`, the table uses the same +`e=1-pu`. When enabled, it decrements `y` modulo `2^W` and returns over +the ones it just wrote. At parity it puts `p` into control, clears +the marker to `P0` and starts a rightward shift. In state `IUc`, the +incoming bit `c` is the original bit to write in the current cell. The +complement of the scanned ordinary bit becomes the next carry. At +the marked sign, the table accepts only `S(1-c)` and writes `S(c)`. +The leftward return only moves the head. + +The sign rule requires that the two highest bits of the recovered +`q` agree. That is exactly the signed range condition +`-2^(W-2) <= q <= 2^(W-2)-1` for reconstructing `x=2q+p`. +For an integer `y` at the inverse boundary, the candidate is +`q=-(y-e)-1=-y-pu`. The only signed wrap in computing `y-e` occurs +at signed minimum with `e=1`. The wrapped word is signed maximum, +whose two highest bits differ. Its complement still has unequal +highest bits, so the guard rejects, as required by the integer +range test. Thus the inverse halts successfully exactly on the forward +image, where it restores `x=-2y+p(1-2u)` and `P0`. Malformed tapes and +rollback of rejected inputs are outside the interface. + +## Local reversibility and exact time + +For each target state, all incoming transitions in the table have the same +move. At fixed coin, the written glyph identifies the source row for that +target state. For example, `FD0` and `FD1` each receive a marked sign +from the scan or one of two distinct ordinary bits from the shift. +Each `IU` state receives `P0` from its unique entry branch at that +coin or one of two distinct ordinary bits while shifting. Ripple turns +and return loops have distinct written glyphs, and the halting branches +write distinct parity glyphs at fixed coin. These finite conditions make +the microstep injective. The target state recovers the predecessor head +position and the written glyph recovers the row. The verifier checks both +conditions on every row. + +The shift and parity handling cost `2W+1` transitions per direction. +For `e=1`, let `k` be the index of the first zero of `~q`, capped at +`W-1`, using `W-1` if every bit is one. The carry phase adds exactly +`2(k+1)` transitions. The inverse decrement turns at the same cell +because the forward increment replaces exactly those low ones by zeros +and flips the turning bit. The all-ones case turns at the sign in both +directions. Therefore the exact invoice on a valid pair is + +| Condition | Transitions per direction | +| --- | ---: | +| `e=0` | `2W+1` | +| `e=1` | `2W+2k+3 <= 4W+1` | + +At `x=0` the complement is all ones and `e=1` for either coin, so the +table reaches `4W+1` in both directions. Relative to #6809's exact +worst case this saves `2W+1` transitions. The comparison is between +the two tables' worst cases. Optimality among all machines remains open. + +## Reproduction + +Run from the repository root with CPython 3.12. The verifier reads the +new table, prints a generated result and writes no files. + +```sh +python3.12 -I -W error -B research/fused-negative-half-tape/verify.py +python3.12 -I -O -W error -B research/fused-negative-half-tape/verify.py +python3.12 -B scripts/research_package.py --package research/fused-negative-half-tape +python3.12 -B scripts/check_research_commit.py --package research/fused-negative-half-tape --check-source-history +``` + +The direct verifier reports `PASS_FUSED_NEGATIVE_HALF_TAPE`. It checks +4,088 exhaustive round trips at widths 2 through 10, 240 translated +boundary round trips through width 4,096, and the full inverse boundary +through width eight (1,016 images and 1,016 nonimages). It also checks five +rejecting controls for coin polarity, the inverse sign guard, an exterior +head movement and both local reversibility conditions. These runs execute +only the new table. The universal quantifier comes from the shift, ripple +and range arguments above. + +The verifier caps the table input at 4,096 ASCII characters and the +simulator at `4W+1` transitions for widths through 4,096. The exhaustive +test domains and mutation set are fixed. Python allocates bounded tape +copies and table entries dynamically for verification. These data +structures describe the experiment and are outside the proved work-tape +budget. + +## Open next questions + +Bind one reached negative half to the marked layout. Start by pinning one +caller site and its signed width, then charge marker setup, resident coin +delivery, parity ownership and the return-state handshake. The supplied +markers, nonbinary glyphs and stationary coin are premises of this local +model. Physical encoding, repeated-call sequencing, reached precision, +native MOVE and the complete supplier bill remain open. This result +establishes a local transition saving and makes no κ claim. + +## Credit + +This contribution was produced by Nick Petalas. Credit ToikY's #6809 for +the negative marked-tape baseline and its open transition-constant question, +Nick Petalas's #6801 for the positive marked shift and local tape model, and +zxv's #6092 and #6066 for the signed arithmetic and restoration contract. +JoyboyBrian's #6095, AAAmirinu's #6244, Nick Petalas's #6026, Ali Romman's +#5599 and the retained stochastic and native lineage supply context. Exact +canonical provenance is recorded in [SOURCES.json](SOURCES.json). +Independent human and formal proof-kernel review are unclaimed. Apache-2.0. + +[negative]: https://github.com/CrocSwap/integer-mult-bounds/pull/6809 +[positive]: https://github.com/CrocSwap/integer-mult-bounds/pull/6801 diff --git a/research/fused-negative-half-tape/SOURCES.json b/research/fused-negative-half-tape/SOURCES.json new file mode 100644 index 0000000000..2e9166e335 --- /dev/null +++ b/research/fused-negative-half-tape/SOURCES.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/linear-negative-half-tape/PROOF.md", + "usage": "provenance", + "git_blob": "60ccb85519c5d9e9fc8f3cfa225eaeffb54361c2", + "sha256": "7e30db75ce6650d68c60bd753152502772c59c5f1755fb05852151c858b2a8d6" + }, + { + "path": "research/linear-positive-half-tape/PROOF.md", + "usage": "provenance", + "git_blob": "f9d159fbb210ba89ac4f6541ac57ff658c82d5cc", + "sha256": "63eb48517f39cd0e66b23705939d74d2455a0c6b91f4da333ef768330b14e793" + }, + { + "path": "research/reversible-signed-half-kernel/PROOF.md", + "usage": "provenance", + "git_blob": "93ebbe2a1eb08e6f2ee55d2b471b5377c154d4e4", + "sha256": "64c9b4b9f58639133f087d77f154b91026a18738bfb0830b93e96d5a30df9932" + } + ] +} diff --git a/research/fused-negative-half-tape/TABLE.txt b/research/fused-negative-half-tape/TABLE.txt new file mode 100644 index 0000000000..ea20f2051e --- /dev/null +++ b/research/fused-negative-half-tape/TABLE.txt @@ -0,0 +1,41 @@ +# State read coin next write move +# * expands to one row for each of the two resident coin values. +F0 P0 * FS P0 1 +FS 0 * FS 0 1 +FS 1 * FS 1 1 +FS S0 * FD0 S1 -1 +FS S1 * FD1 S0 -1 +FD0 0 * FD0 1 -1 +FD0 1 * FD1 1 -1 +FD1 0 * FD0 0 -1 +FD1 1 * FD1 0 -1 +FD0 P0 * FI P0 1 +FD1 P0 0 FI P1 1 +FD1 P0 1 FH P1 0 +FI 0 * FR 1 -1 +FI 1 * FI 0 1 +FI S0 * FR S1 -1 +FI S1 * FR S0 -1 +FR 0 * FR 0 -1 +FR P0 * FH P0 0 +FR P1 0 FH P1 0 + +I0 P0 * ID P0 1 +I0 P1 0 ID P1 1 +I0 P1 1 IU1 P0 1 +ID 0 * ID 1 1 +ID 1 * IR 0 -1 +ID S0 * IR S1 -1 +ID S1 * IR S0 -1 +IR 1 * IR 1 -1 +IR P0 * IU0 P0 1 +IR P1 0 IU1 P0 1 +IU0 0 * IU1 0 1 +IU0 1 * IU0 0 1 +IU1 0 * IU1 1 1 +IU1 1 * IU0 1 1 +IU0 S1 * IB S0 -1 +IU1 S0 * IB S1 -1 +IB 0 * IB 0 -1 +IB 1 * IB 1 -1 +IB P0 * IH P0 0 diff --git a/research/fused-negative-half-tape/TASK.json b/research/fused-negative-half-tape/TASK.json new file mode 100644 index 0000000000..3793e1d6c8 --- /dev/null +++ b/research/fused-negative-half-tape/TASK.json @@ -0,0 +1,84 @@ +{ + "schema_version": 1, + "task_id": "joint-query-controller", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "joint-query-controller", + "question": "Can a changed query demand or caller remove real work while satisfying native chronology and restoration?", + "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": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.", + "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 an exact caller and a new demand/interface hypothesis. Read the scoped #5617/#5631/#5649/#5747 and #5720/#5745 objections before rebuilding an excluded schedule. Compare the complete matched source/consumer protocols including all retained helper outputs. For an active-mode injection, first check #5745: its canonical delivery claim repays the eight removed centre jobs. Audit that exact claim or change its channel/feedback hypothesis; do not repeat the same free-injection search. Stop if the full favorable budget fails or the required restored output is unobservable.", + "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": [ + "query demand", + "active mode", + "5720", + "5745", + "5747", + "caller" + ], + "existing_checks": [ + { + "scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.", + "evidence": "research/qq16-caller-install/README.md", + "remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.", + "status": "author-checked", + "source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630", + "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": "Lower the negative stochastic half's exact worst-case transition count on the supplied six-glyph marked tape.", + "scope_change_reason": "PR #6809 leaves the local transition constant open. This is one arithmetic component outside the full caller and query-scheduling gate.", + "bottleneck_link": "The fused shift removes an entire negation scan under the same local contract. Marker, coin, native and caller costs remain open, so the local saving does not establish a supplier improvement.", + "budget_minutes": 60, + "stop_rule": "Stop at the first faster reversible table with a written all-width proof and exact finite replay.", + "outcome": "partial", + "evidence": "README.md gives the exact 4W+1 worst case per direction. TABLE.txt and verify.py check the literal 70-row table, arithmetic endpoints, inverse image, time and failure controls.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can one reached negative half use this marked-tape interface at a lower fully charged cost?", + "why_it_matters": "A local transition saving affects a supplier only after the actual producer and consumer can use it.", + "first_step": "Pin one reached site and budget marker setup, the signed width, resident coin delivery, parity ownership and the return-state handshake.", + "blocked_by": "A source-bound caller with a charged physical encoding and delivery contract." + } + ] +} diff --git a/research/fused-negative-half-tape/VERIFY.json b/research/fused-negative-half-tape/VERIFY.json new file mode 100644 index 0000000000..1bed4ee2b2 --- /dev/null +++ b/research/fused-negative-half-tape/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Literal table local reversibility, exact signed endpoints, head returns, transition count, inverse image and five failure controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Literal table local reversibility, exact signed endpoints, head returns, transition count, inverse image and five failure controls." + } + ] +} diff --git a/research/fused-negative-half-tape/verify.py b/research/fused-negative-half-tape/verify.py new file mode 100644 index 0000000000..06b361c299 --- /dev/null +++ b/research/fused-negative-half-tape/verify.py @@ -0,0 +1,201 @@ +"""Replay the literal negative-half table against exact signed arithmetic.""" + +import json +from pathlib import Path + + +GLYPHS = frozenset(("0", "1", "P0", "P1", "S0", "S1")) +PACKAGE = Path(__file__).resolve().parent +MAX_WIDTH = 4096 + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def load_table(): + with (PACKAGE / "TABLE.txt").open(encoding="ascii") as source: + text = source.read(4097) + require(len(text) <= 4096, "table exceeds 4096 characters") + table = {} + for line in text.splitlines(): + if not line.strip() or line.startswith("#"): + continue + state, read, coin, target, write, move = line.split() + require(read in GLYPHS and write in GLYPHS, "invalid glyph") + require(move in ("-1", "0", "1"), "invalid movement") + require(coin in ("*", "0", "1"), "invalid coin") + require(state[0] == target[0] and state[0] in "FI", "mixed directions") + for bit in (0, 1) if coin == "*" else (int(coin),): + key = (state, read, bit) + require(key not in table, "duplicate input row") + table[key] = (target, write, int(move)) + require(len(table) == 70, "expected 70 coin-expanded rows") + for direction in "FI": + require(sum(key[0].startswith(direction) for key in table) == 35, + "expected 35 rows per direction") + return table + + +def check_local_inverse(table): + directions = {} + predecessors = set() + for (_, _, coin), (target, write, move) in table.items(): + require(directions.setdefault(target, move) == move, + "ambiguous incoming head movement") + key = (target, write, coin) + require(key not in predecessors, "ambiguous predecessor row") + predecessors.add(key) + + +def signed_bounds(width): + return -(1 << (width - 1)), (1 << (width - 1)) - 1 + + +def marked_bits(value, width, parity): + lower, upper = signed_bounds(width) + require(lower <= value <= upper, "value outside signed width") + bits = [str((value >> bit) & 1) for bit in range(width)] + bits[-1] = "S" + bits[-1] + return [f"P{parity}", *bits] + + +def execute(table, tape, origin, width, coin, direction): + require(2 <= width <= MAX_WIDTH, "unsupported replay width") + head, state = origin, direction + "0" + for steps in range(4 * width + 2): + require(origin <= head <= origin + width, "exterior head excursion") + if state == direction + "H": + return steps, state, head + row = table.get((state, tape[head], coin)) + if row is None: + return steps, state, head + state, tape[head], move = row + head += move + raise ValueError("transition bound exceeded") + + +def expected_steps(x, width, coin): + quotient, parity = divmod(x, 2) + if parity * coin: + return 2 * width + 1 + trailing_zeros = (quotient & -quotient).bit_length() - 1 + turning_index = width - 1 if quotient == 0 else trailing_zeros + return 2 * width + 2 * turning_index + 3 + + +def round_trip(table, x, width, coin, origin): + prefix = list(("S1", "P1", "0", "S0")[:origin]) + suffix = ["P0", "S1", "1"] + initial = prefix + marked_bits(x, width, 0) + suffix + tape = initial.copy() + steps, state, head = execute(table, tape, origin, width, coin, "F") + y, remainder = divmod(-x, 2) + y += int(coin < remainder) + expected = prefix + marked_bits(y, width, x % 2) + suffix + require((state, head) == ("FH", origin), "forward return") + require(tape == expected, "forward endpoint") + require(steps == expected_steps(x, width, coin), "forward invoice") + inverse = execute(table, tape, origin, width, coin, "I") + require(inverse == (steps, "IH", origin), "inverse return or invoice") + require(tape == initial, "inverse endpoint") + return 2 * steps + + +def inverse_boundary(table, width, y, parity, coin): + tape = marked_bits(y, width, parity) + steps, state, head = execute(table, tape, 0, width, coin, "I") + x = -2 * y + parity * (1 - 2 * coin) + lower, upper = signed_bounds(width) + if lower <= x <= upper: + require((steps, state, head) == (expected_steps(x, width, coin), "IH", 0), + "valid inverse return or invoice") + require(tape == marked_bits(x, width, 0), "valid inverse endpoint") + return True + require(state in ("IU0", "IU1") and head == width, + "nonimage did not stop at sign guard") + require(tape[head] != ("S1" if state == "IU0" else "S0"), + "inverse stopped on a valid sign symbol") + return False + + +def check_round_trips(table): + exhaustive = translated = transitions = 0 + for width in range(2, 11): + lower, upper = signed_bounds(width) + for x in range(lower, upper + 1): + for coin in (0, 1): + transitions += round_trip(table, x, width, coin, 0) + exhaustive += 1 + for width in (16, 64, 257, 1024, MAX_WIDTH): + lower, upper = signed_bounds(width) + for x in (lower, lower + 1, -2, -1, 0, 1, upper - 1, upper): + for coin in (0, 1): + for origin in (1, 2, 4): + steps = round_trip(table, x, width, coin, origin) + if x == 0: + require(steps == 2 * (4 * width + 1), "worst-case witness") + transitions += steps + translated += 1 + return exhaustive, translated, transitions + + +def check_inverse_boundary(table): + accepted = rejected = 0 + for width in range(2, 9): + lower, upper = signed_bounds(width) + for y in range(lower, upper + 1): + for parity in (0, 1): + for coin in (0, 1): + if inverse_boundary(table, width, y, parity, coin): + accepted += 1 + else: + rejected += 1 + return accepted, rejected + + +def check_controls(table): + flipped_coin = {(state, read, 1 - coin): row + for (state, read, coin), row in table.items()} + missing_guard = table | {("IU0", "S0", 0): ("IB", "S0", -1)} + excursion = table | {("F0", "P0", 0): ("FS", "P0", -1)} + collision = table | {("FR", "P1", 1): ("FH", "P1", 0)} + controls = ( + ("forward endpoint", round_trip, (flipped_coin, 1, 3, 0, 0)), + ("nonimage did not stop at sign guard", inverse_boundary, + (missing_guard, 2, -2, 0, 0)), + ("exterior head excursion", round_trip, (excursion, 0, 3, 0, 2)), + ("ambiguous predecessor row", check_local_inverse, (collision,)), + ("ambiguous incoming head movement", check_local_inverse, (excursion,)), + ) + for message, check, arguments in controls: + try: + check(*arguments) + except ValueError as error: + require(str(error) == message, f"wrong failure reason: {error}") + else: + raise ValueError(f"control failed to reject: {message}") + return len(controls) + + +def main(): + table = load_table() + check_local_inverse(table) + exhaustive, translated, transitions = check_round_trips(table) + accepted, rejected = check_inverse_boundary(table) + controls = check_controls(table) + print(json.dumps({ + "status": "PASS_FUSED_NEGATIVE_HALF_TAPE", + "rows": len(table), + "exhaustive_round_trips": exhaustive, + "translated_round_trips": translated, + "round_trip_transitions": transitions, + "inverse_images": accepted, + "inverse_nonimages": rejected, + "rejecting_controls": controls, + }, sort_keys=True)) + + +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")