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") diff --git a/research/kind-a-last-call-coset/README.md b/research/kind-a-last-call-coset/README.md new file mode 100644 index 0000000000..10f826c126 --- /dev/null +++ b/research/kind-a-last-call-coset/README.md @@ -0,0 +1,132 @@ +# Exact kind A finishability in the frame game + +This scoped written proof answers the finishing half of the second open question +in Jacob Sussman's [PR #7629](https://github.com/CrocSwap/integer-mult-bounds/pull/7629). +At every address width $m\ge 3$, a kind A part with nonzero rational +coefficient finishes by a final call alone exactly when its two terms have the +same frame and the corresponding binomial is invertible. This includes the +three-direction target with spare address bits. It rules out the distinct-frame +case for every final call that raises the plain term to level three. + +This contribution was produced by Nick Petalas. New work is Apache-2.0. +Independent human and formal proof-kernel review are unclaimed. + +## Model and statement + +Let $G=\operatorname{Sp}(2m,2)$, let $L$ be the raw Lagrangian, and let +$P=\operatorname{Stab}_G(L)$. A term $g\in G$ is a formal basis element of +$\mathbb Q[G]$. Its frame is $g^{-1}L$, and its level is the distance of that +frame from $L$, namely $m-\dim(L\cap g^{-1}L)$. A free combination on the +left lies in $\mathbb Q[P]$. Paid calls are transvections with normal outside +$L$. Products act right to left. + +Write $D,W,T$ for the first, shared and final calls. Let $M=WD$ have level +two and $TM$ have level three. For $\gamma\in P$ and $c\in\mathbb Q\setminus\{0\}$, +the kind A part is $y=M+cE$, where $E=W\gamma D$. Assume $E\notin P$, which +excludes an extra term that is a free image of the raw input. As in #7629, +free preparation and additions of earlier outputs are available, and the final +call acts on one prepared input. Thus the part finishes for this $T$ precisely +if $TM\in U+TU$, where +$$ +U=\mathbb Q[P]\cdot 1+\mathbb Q[P]\cdot D+\mathbb Q[P]\cdot y. +$$ + +**Theorem.** For every such $T$, this membership holds if and only if $E$ and +$M$ have the same frame and $(-c)^n\ne 1$, where $n=\operatorname{ord}(\gamma)$. +In the same-frame case $EM^{-1}$ is conjugate to $\gamma$, so it has the same +order. + +## Proof + +The level is invariant under left and right multiplication by $P$. It is +subadditive because the group action is isometric for the frame distance +$d(F,F')=m-\dim(F\cap F')$. The individual calls have level one. Since $TWD$ +has level three, subadditivity gives level two for $TW$. + +Multiply all terms on the right by $D^{-1}=D$. The target becomes $TW$, and +the normalized generators of the free part are $P,PD$ and $pW(1+c\gamma)$ +for $p\in P$. The paid part has the same generators with $T$ on the left. +Project onto the coefficients indexed by $TWP$. This coset is stable under +right multiplication by $\gamma$ and has level two throughout. All the +normalized free generators have support at levels zero or one, so they +project to zero. + +Let $H=P\cap W^{-1}PW$. Index the coset by $h\in P$, with $e_h=[TWh]$. +The paid binomial columns that survive are +$$ +e_h+c e_{h\gamma}\qquad(h\in H). +$$ +Indeed $TpW=TWh$ is equivalent to $p=WhW^{-1}\in P$, and right +multiplication by $\gamma$ keeps both terms in the same coset. A singleton +$e_h$ can come from the paid copies of earlier inputs only if $Wh\in P$ +or $WhD\in P$. The first is impossible because $Wh$ has level one. + +The two frames coincide exactly when $EM^{-1}=W\gamma W^{-1}\in P$, or +equivalently $\gamma\in H$. + +- If $\gamma\notin H$, neither $e_1$ nor $e_\gamma$ is an earlier-input + singleton. This follows from $WD=M\notin P$ and $W\gamma D=E\notin P$. + The column at $h=1$ is the only column touching either coordinate, because + $H$ contains neither $\gamma$ nor $\gamma^{-1}$. Thus every reachable + vector has coefficient at $e_\gamma$ equal to $c$ times the coefficient + at $e_1$. The desired singleton $e_1$ violates that relation. +- If $\gamma\in H$, restrict further to the coordinates $e_{\gamma^j}$ for + $0\le j= 3 and every nonzero rational coefficient, with a level-three target and with free preparation and earlier-output addition.", + "scope_change_reason": "Take the concrete open finishability question in Jacob Sussman's PR #7629 at c2a2131e7dba35f9396b16588e125a7e8b5fab8e. The single-output restriction gives a formal coframe obstruction before any physical caller or invoice.", + "bottleneck_link": "Side result. The criterion removes distinct-frame preparations from a restricted shared-call search for two three-direction outputs in five calls, including a spare address bit.", + "budget_minutes": 60, + "stop_rule": "Give one written exact finishing criterion and standalone controls. Leave joint finishing, removability and native pricing as separate questions.", + "outcome": "completed", + "evidence": "README.md gives the all-width coset proof. verify.py checks eight concrete cases on five and six address bits and one free post-call control in exact rational arithmetic. CPython 3.12, standard library only.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "With one free operation after the final call, is finishing a distinct-frame part possible only when both terms acquire the same frame after the call?", + "why_it_matters": "A free post-call operation rescues some parts excluded by the one-call result.", + "first_step": "Project the free translates of the paid generators and identify which extra columns meet the target coset.", + "blocked_by": "The free post-call columns can break the two-coordinate relation in the present proof." + }, + { + "question": "Can coupling both last-call outputs evade the separate one-output obstructions?", + "why_it_matters": "The intended two-output unit can mix its outputs.", + "first_step": "Project both paid column families in one three-direction instance with a spare address bit.", + "blocked_by": "The fixed single-call coset does not isolate the second family." + } + ] +} diff --git a/research/kind-a-last-call-coset/VERIFY.json b/research/kind-a-last-call-coset/VERIFY.json new file mode 100644 index 0000000000..6ce71306ea --- /dev/null +++ b/research/kind-a-last-call-coset/VERIFY.json @@ -0,0 +1,21 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Eight exact target-orbit memberships on concrete five- and six-bit symplectic fixtures. Includes separate free post-call one-output control." + } + ] +} diff --git a/research/kind-a-last-call-coset/verify.py b/research/kind-a-last-call-coset/verify.py new file mode 100644 index 0000000000..6da3e5e00c --- /dev/null +++ b/research/kind-a-last-call-coset/verify.py @@ -0,0 +1,156 @@ +"""Exact target-orbit span checks for the kind A finishing criterion.""" + +from fractions import Fraction + + +Matrix = tuple[int, ...] + + +def require(condition: bool, message: str) -> None: + if not condition: + raise AssertionError(message) + + +def apply(matrix: Matrix, vector: int) -> int: + image = 0 + for index, column in enumerate(matrix): + if vector & (1 << index): + image ^= column + return image + + +def compose(left: Matrix, right: Matrix) -> Matrix: + return tuple(apply(left, column) for column in right) + + +def transvection(m: int, normal: int) -> Matrix: + x_mask = (1 << m) - 1 + paired = ((normal & x_mask) << m) | (normal >> m) + return tuple( + (1 << index) ^ (normal if paired & (1 << index) else 0) + for index in range(2 * m) + ) + + +def axis_permutation(axes: tuple[int, ...]) -> Matrix: + m = len(axes) + return tuple(1 << (index + shift) for shift in (0, m) for index in axes) + + +def level(matrix: Matrix) -> int: + m = len(matrix) // 2 + mask = (1 << m) - 1 + images = {apply(matrix, z << m) & mask for z in range(1 << m)} + return len(images).bit_length() - 1 + + +def is_free(matrix: Matrix) -> bool: + m = len(matrix) // 2 + mask = (1 << m) - 1 + return all(column & mask == 0 for column in matrix[m:]) + + +def target_orbit(target: Matrix, gamma: Matrix, order: int) -> list[Matrix]: + orbit = [target] + for _ in range(1, order): + orbit.append(compose(orbit[-1], gamma)) + require(len(set(orbit)) == order, "target orbit closed early") + require(compose(orbit[-1], gamma) == target, "target orbit did not close") + return orbit + + +def orbit_columns( + orbit: list[Matrix], first: Matrix, shared: Matrix, last: Matrix, c: Fraction +) -> list[list[Fraction]]: + """Restrict each possible generator to the orbit of the normalized target.""" + size = len(orbit) + columns = [] + for index, term in enumerate(orbit): + after_last_inverse = compose(last, term) + for candidate in (term, after_last_inverse): + if is_free(candidate) or is_free(compose(candidate, first)): + column = [Fraction(0)] * size + column[index] = Fraction(1) + columns.append(column) + if is_free(compose(candidate, shared)): + column = [Fraction(0)] * size + column[index] = Fraction(1) + column[(index + 1) % size] += c + columns.append(column) + return columns + + +def rank(columns: list[list[Fraction]], size: int) -> int: + pivots: dict[int, list[Fraction]] = {} + for column in columns: + for index in range(size): + entry = column[index] + if not entry: + continue + if index not in pivots: + pivots[index] = [value / entry for value in column] + break + column = [ + value - entry * pivot + for value, pivot in zip(column, pivots[index], strict=True) + ] + return len(pivots) + + +def spans_target(columns: list[list[Fraction]], size: int) -> bool: + target = [Fraction(1)] + [Fraction(0)] * (size - 1) + return rank(columns, size) == rank([*columns, target], size) + + +def check_case( + name: str, gamma: Matrix, order: int, c: Fraction, same_frame: bool, expected: bool +) -> None: + m = len(gamma) // 2 + first, shared, last = (transvection(m, 1 << axis) for axis in range(3)) + target = compose(last, shared) + second = compose(shared, gamma) + require(is_free(gamma), f"{name}: gamma must be free") + require(level(compose(shared, first)) == 2, f"{name}: middle level") + require(level(compose(target, first)) == 3, f"{name}: target level") + require(is_free(compose(second, shared)) == same_frame, f"{name}: frame relation") + raw_extra = is_free(compose(second, first)) + require(raw_extra == (name == "raw extra term"), f"{name}: raw support") + orbit = target_orbit(target, gamma, order) + columns = orbit_columns(orbit, first, shared, last, c) + require(spans_target(columns, order) == expected, f"{name}: wrong finishability") + + if name == "post-call free operation": + require(compose(gamma, target) == orbit[1], "free translate must swap endpoints") + require([Fraction(1), c] in columns, "missing direct paid output") + with_post_call_free = [*columns, [c, Fraction(1)]] + require(spans_target(with_post_call_free, order), "post-call control must finish") + + +def main() -> None: + cross = compose( + transvection(5, (1 << 6) | (1 << 8)), + compose(transvection(5, 1 << 6), transvection(5, 1 << 8)), + ) + require( + compose(cross, transvection(5, 2)) != compose(transvection(5, 2), cross), + "same-frame fixture must distinguish stabilizing a frame from commuting", + ) + order_three = axis_permutation((0, 1, 2, 4, 5, 3)) + cases = ( + ("distinct frames on one axis", transvection(5, 1 << 6), 2, Fraction(3), False, False), + ("distinct frames on two axes", axis_permutation((0, 3, 2, 1, 4, 5)), + 2, Fraction(-2, 3), False, False), + ("same frame order two with invertible binomial", cross, 2, Fraction(-2, 3), True, True), + ("same frame order two with singular binomial", cross, 2, Fraction(1), True, False), + ("same frame order three with invertible binomial", order_three, 3, Fraction(3, 2), True, True), + ("same frame order three with singular binomial", order_three, 3, Fraction(-1), True, False), + ("raw extra term", axis_permutation((1, 0, 2, 3, 4)), 2, Fraction(3), False, True), + ("post-call free operation", axis_permutation((0, 2, 1, 3, 4)), 2, Fraction(3), False, False), + ) + for case in cases: + check_case(*case) + print(f"PASS_KIND_A_LAST_CALL_COSET cases={len(cases)} post_call_control=1") + + +if __name__ == "__main__": + main()