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/shifted-persistence-threshold/PROOF.md b/research/shifted-persistence-threshold/PROOF.md new file mode 100644 index 0000000000..f91657a594 --- /dev/null +++ b/research/shifted-persistence-threshold/PROOF.md @@ -0,0 +1,166 @@ +# A shifted sufficient threshold for the one-step comparison + +This scoped proof was produced by Nick Petalas. Apache-2.0. + +## Statement + +Let `d0,a,b` be positive integers, and put `D=d0*b`. Define + +```text +T(a,D) = 1 if a>D, + max(2, ceil((3D-a)/(2a))) if a<=D. +``` + +For every integer `m>=T(a,D)`, + +```text +(m+1)^D < 2^a m^D. (1) +``` + +Moreover, `T(a,D)<=ceil(27D/(17a))` for every positive integer `a,D`. +At `(d0,a,b)=(1,1,5)` the new sufficient threshold is the exact minimum +`7`, whereas the cited #7450 sufficient threshold is `8`. At `(1,2,5)` +both sufficient thresholds are the exact minimum `4`. + +This is a new application of a classical elementary analytic inequality. +No novelty is claimed for that inequality or for logarithmic differentiation. +The general sufficient threshold is not claimed to be an exact minimum. + +## The shifted power inequality + +For real `x>0`, put `F(x)=(2x+1) log(1+1/x)`, using natural logarithms. +Differentiation gives + +```text +F'(x) = 2 log(1+1/x) - (2x+1)/(x(x+1)). +``` + +The function `t -> 1/t` is strictly convex on the positive real axis. +On `[x,x+1]` its graph is strictly below the secant except at the endpoints. +Integration therefore gives + +```text +log(1+1/x) = integral_x^(x+1) dt/t + < (1/2)(1/x + 1/(x+1)). +``` + +Consequently `F'(x)<0`. Since `F(1)=3 log 2`, every real `x>1` satisfies +`F(x)<3 log 2`. Exponentiating, for every integer `m>=2`, + +```text +((m+1)/m)^(2m+1) < 8. (2) +``` + +At `m=1` there is equality, not strict inequality. This endpoint is why +the definition of `T` separates `a>D` and requires `m>=2` otherwise. + +## Deriving the threshold + +Suppose `m>=2` and `a(2m+1)>=3D`. Raise (2) to the positive integer power +`D` and use that exponent inequality: + +```text +((m+1)/m)^(D(2m+1)) < 2^(3D) <= 2^(a(2m+1)). +``` + +Taking a positive `(2m+1)`-st root proves (1). Its hypothesis holds when +`m>=ceil((3D-a)/(2a))`. Thus the stated `T` works when `a<=D`. + +If `a>D`, then for every integer `m>=1`, `(m+1)/m<=2`, so +`((m+1)/m)^D<=2^D<2^a`. Therefore `T=1` works in this case. + +All inequalities are strict where required. In particular, equality in +`a(2m+1)>=3D` is allowed because (2) is strict for `m>=2`. + +## Comparison with the cited bound + +The predecessor #7450 supplies `ceil(27D/(17a))` as a sufficient threshold +through a uniform binomial bound and the pair `3^17<2^27`. That predecessor +result is a cited premise, not a replay target. The following comparison is +also an elementary comparison of the two displayed formulas. + +When `a>D`, the old ceiling is at least one, so it is at least `T=1`. +When `a<=D`, put `R=D/a>=1`. The old ceiling is at least two, and + +```text +27R/17 - (3R-1)/2 = 3R/34 + 1/2 > 0. +``` + +Ceiling monotonicity then gives + +```text +max(2, ceil((3R-1)/2)) <= ceil(27R/17). +``` + +Hence the new sufficient threshold never worsens that cited threshold. + +## The two sharp examples + +For `D=5,a=1`, the new value is `ceil(14/2)=7`. At its predecessor, + +```text +7^5 = 16807 > 15552 = 2*6^5. +``` + +Thus (1) fails at `m=6`. The theorem proves (1) for every `m>=7`; +directly, `8^5=32768<33614=2*7^5`. This makes seven the least integer +threshold valid for all subsequent integers at this triple. + +For `D=5,a=2`, the new value is `ceil(13/4)=4`. At its predecessor, + +```text +4^5 = 1024 > 972 = 4*3^5. +``` + +The theorem proves (1) for every `m>=4`; directly, +`5^5=3125<4096=4*4^5`. Thus four remains the exact threshold. + +These examples do not make the general formula an exact minimum. For +`D=10,a=1`, it gives fifteen, but (1) already holds at fourteen because +`15^10=576650390625<578509309952=2*14^10`. + +## Persistence at the retained comparison + +Section 6 of the #7000 application review considers a fixed constant +`C>=1`, an integer degree `d0` and positive rational slack `delta=a/b`. +For positive `d0`, raising its comparison to the power `b` gives + +```text +P(j): C^b (j+1)^D <= 2^(aj), D=d0*b. +``` + +If `P(j)` holds and `j+1>=T(a,D)`, apply (1) at `m=j+1`: + +```text +C^b (j+2)^D < 2^a C^b (j+1)^D <= 2^(a(j+1)). +``` + +Thus `P(j+1)` holds, and induction proves `P(k)` for every integer `k>=j`. +When `d0=0`, this persistence is immediate without a threshold lemma. +This establishes a smaller sufficient one-step region. It does not supply +an initial `j` satisfying `P(j)`, compute any complete selected cutoff, +or replace the other conditions in the review. + +## Evidence and limits + +The universal claims above follow from the written argument. The verifier +corroborates (2) for `m=2..256`, and decreasing `F` at consecutive integers +for `m=1..255` by exact cross-multiplication. It checks both threshold +formulas for every `a,D=1..96`, and checks (1) at each new threshold and +the next two integers. These are bounded finite checks of this new result. +They do not replay a predecessor verifier or establish the analytic proof +by enumeration. All arithmetic in the verifier is exact integer arithmetic. + +The comparison is an auxiliary threshold lemma, not a physical supplier, +a new kappa, or a complete multiplication theorem. All five selected +framework assumptions remain. Independent human and formal proof-kernel +review are unclaimed. + +## Open next questions + +Can an elementary rational correction to the shifted bound remove the +remaining sufficient-versus-necessary gap, such as fifteen versus fourteen +at `D=10,a=1`? A first step is an explicit upper bound for +`log(1+1/m)` with one more rational term and a proof that the resulting +integer test is no worse. This may reduce the auxiliary persistence region; +it does not determine the initial selected cutoff or settle physical costs. diff --git a/research/shifted-persistence-threshold/README.md b/research/shifted-persistence-threshold/README.md new file mode 100644 index 0000000000..3c353a825b --- /dev/null +++ b/research/shifted-persistence-threshold/README.md @@ -0,0 +1,119 @@ +# A shifted persistence threshold that includes the missing seven-step case + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written proof with exact finite corroboration. For +positive integers `d0,a,b`, set `D=d0*b` and + +```text +T = 1 if a>D, + max(2,ceil((3D-a)/(2a))) otherwise. +``` + +For every integer `m>=T`, `(m+1)^D < 2^a m^D`. The new `T` is never larger +than `ceil(27D/(17a))`, the sufficient threshold in unpaidmoon's +[PR #7450](https://github.com/CrocSwap/integer-mult-bounds/pull/7450). +At `(d0,a,b)=(1,1,5)` it lowers eight to the sharp seven. At `(1,2,5)` +the sharp four is preserved. The proof uses the classical decreasing +function `(2x+1) log(1+1/x)`. The threshold application is the new result. + +[PROOF.md](PROOF.md) gives the complete argument, the exact endpoint +exception at `m=1`, and the persistence implication. The general sufficient +threshold is not an exact minimum. For example it gives fifteen at +`D=10,a=1`, where fourteen already works. + +## Source and scope + +This answers Open next question 1 of unpaidmoon #7450 at +`f9b9057f9befe744df7f6b58b61b53e77001af1f` using an `m`-dependent inequality, +instead of refining another pair `3^p<2^q` under its uniform bound. Its +power-pair census and persistence construction are cited, not audited or +replayed. The question is the source; the classical convexity argument is +self-contained. No predecessor code or data is needed to run this verifier. + +The retained comparison is section 6 of +[the #7000 application review](../../docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md). +[SOURCES.json](SOURCES.json) pins that historical context, the selected +record and the originating card at canonical base +`e54523517d0f03e58352e647c403a5af3e525a57`. These are provenance, not live +mathematical inputs. The source PR is external context with its exact head +and URL recorded in [TASK.json](TASK.json). + +Card `uniform-transfer-audit` has changed scope to this auxiliary lemma. +It reduces a sufficient persistence region relevant to the effective +cutoff discussion. It neither constructs the initial successful index nor +discharges `precision_tape` or another framework assumption. Selected +`kappa=363005817/100000000000` is unchanged. + +## Reproduce + +Use CPython 3.12 and the standard library, from the repository root: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -W error -B research/shifted-persistence-threshold/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -O -W error -B research/shifted-persistence-threshold/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/shifted-persistence-threshold +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/shifted-persistence-threshold --check-source-history +``` + +On another machine, substitute its CPython 3.12 executable. The direct +verifier emits `PASS_SHIFTED_PERSISTENCE_THRESHOLD` in a JSON receipt +containing all six package-file SHA256 hashes and the exact enumerated +counts. Redirect it outside the checkout to retain a generated receipt. +No handwritten receipt or generated replay output is committed. + +The bounded checks cover 255 shifted-power cases, 255 consecutive decreases, +9,216 parameter pairs and 27,648 one-step evaluations. In that parameter +rectangle, 4,753 threshold pairs strictly improve. Nine semantic controls +cover both sharp examples, strict equality, the `m=1` branch, a +sufficient-versus-necessary distinction and an overstrong slope. Eight +invalid parameter pairs must fail with the exact declared reason. Optimized +execution keeps every check active because checks do not rely on `assert`. + +No selected cold replay, predecessor scientific suite, Lean or Docker run +is needed for this local theorem. No hosted CI success is claimed here. + +## Verification design + +`verify.py` has a fixed finite workload, no recursion, subprocesses, +network calls, file writes or dynamic dispatch. All functions are shorter +than sixty lines. Positive-integer arguments are validated at the threshold +boundary; all result checks raise explicit errors even under `-O`. + +Power of Ten rule 3 has a managed-runtime deviation in `verify.py`: CPython +allocates arbitrary-precision integers during execution. The finite ranges +bound each power-product operand below `2^10240`, and the verifier retains +only one case at a time plus six source hashes. The registered commands +exercise that complete bounded workload. If these ranges become configurable, +the change must introduce explicit input and memory caps. Python has no +compiler warning mode; both registered commands use `-W error`. The package +does not alter shared diagnostics or repository CI configuration. Ruff and +Mypy are unavailable on the local PATH; in-memory compilation and the +warning-strict registered replays are the available Python diagnostics. + +## Related open work + +- [#7450](https://github.com/CrocSwap/integer-mult-bounds/pull/7450), unpaidmoon, + supplies the `27/17` bound and explicitly asks about the missing `m=7` + case. This proof includes that case and retains the same sharp four. +- [#7286](https://github.com/CrocSwap/integer-mult-bounds/pull/7286), unpaidmoon, + tightens a monomial record count used elsewhere in the same review. + Its count and elimination model are independent of this one-step inequality. + +## Open next questions + +The final section of [PROOF.md](PROOF.md) asks for a sharper elementary +correction where this sufficient bound exceeds the true threshold. Its +first example is `D=10,a=1`; no external blocker is required to begin. +Physical implementation, complete cutoffs, supplier admission and all five +framework assumptions remain separate obligations. + +## Credit + +Credit unpaidmoon #7450 for the source question, the prior `27/17` threshold +and its retained persistence-note lineage at +`8e0124415604b89a1cfc842cb6dc6da96ea87ac5`. Credit Douglas Colkitt's retained +#7000 application review for the effective-cutoff comparison. The convexity, +logarithm and induction arguments are classical. The shifted +threshold, its application and its exact verifier were produced by Nick +Petalas. Independent human and formal proof-kernel review are unclaimed. diff --git a/research/shifted-persistence-threshold/SOURCES.json b/research/shifted-persistence-threshold/SOURCES.json new file mode 100644 index 0000000000..cfcfe0ca38 --- /dev/null +++ b/research/shifted-persistence-threshold/SOURCES.json @@ -0,0 +1,24 @@ +{ + "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": "docs/research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md", + "usage": "provenance", + "git_blob": "3dd1af2285e597676725e85ad4f65e7ad326d695", + "sha256": "4501502c2ceb9759b20372435fe4beb51082c5a5e2910c1fd5dbe6edca415055" + } + ] +} diff --git a/research/shifted-persistence-threshold/TASK.json b/research/shifted-persistence-threshold/TASK.json new file mode 100644 index 0000000000..c5fadef43c --- /dev/null +++ b/research/shifted-persistence-threshold/TASK.json @@ -0,0 +1,111 @@ +{ + "schema_version": 1, + "task_id": "uniform-transfer-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "uniform-transfer-audit", + "question": "Can one of the selected record's five inherited assumptions be proved at its actual caller?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "Identify the proposition and what would change downstream; do not equate a finite replay with a universal proof.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Choose one assumption ID (native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery), one quantified implication and exact dependency closure. Check current handoffs, including #5625 row reentry and #5707 root-prefix lowering, without treating their partial scope as the whole theorem. Prove or falsify that implication with a caller-bound argument; stop at the chosen obligation. Finite tests or root digits do not discharge an all-size statement.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "native_all_columns", + "owned_erasure", + "compiler", + "precision_tape", + "analytic_recovery" + ], + "existing_checks": [ + { + "scope": "PR #4100: proposed unconditional construction and finite checks, without independent acceptance.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Independent proof audit of one caller-bound all-size implication; all other premises remain explicit.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "A self-contained shifted sufficient threshold for (m+1)^(d0*b) < 2^a m^(d0*b), with exact sharp seven and four examples.", + "scope_change_reason": "Answer Open next question 1 of unpaidmoon PR7450 rather than audit a predecessor or discharge a complete selected assumption.", + "bottleneck_link": "Auxiliary effective-cutoff persistence comparison in section 6 of the selected #7000 application review. This changes a sufficient one-step region only.", + "budget_minutes": 60, + "stop_rule": "Stop after the first proved threshold improvement and its bounded exact verifier.", + "outcome": "completed", + "evidence": "PROOF.md is the scoped universal argument; verify.py corroborates shifted powers, 9216 parameter pairs, 27648 steps and boundary/failure controls. It emits generated six-file hash-bound JSON receipts.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can a further rational correction reduce the gap between the shifted sufficient threshold and the exact minimum, first at D=10,a=1?", + "why_it_matters": "A smaller sufficient region can reduce an auxiliary effective-cutoff requirement without changing the supplier.", + "first_step": "Bound log(1+1/m) with one more rational term and derive a sufficient integer inequality that is no worse.", + "blocked_by": "No external blocker; initial successful cutoff and physical costs remain separate." + } + ], + "claim_type": "scoped proof with exact finite corroboration", + "source_question": { + "pr": 7450, + "author": "unpaidmoon", + "head": "f9b9057f9befe744df7f6b58b61b53e77001af1f", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7450", + "location": "research/threshold-ratio-sharper-pair/README.md, Open next questions 1", + "usage": "external context; no predecessor computation is replayed" + }, + "claim_url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19572802", + "environment": { + "interpreter": "/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12", + "dependencies": "standard library only", + "python_version": "3.12.15" + }, + "overlap": { + "checked_at": "2026-11-12T19:17:00Z", + "open_prs": 768, + "discussion_records": 7356, + "own_recent_prs_in_source_check": 106, + "own_recent_source_matches": 0, + "note": "Full remote pagination; sparse local scan supplemented by origin/main README Git searches. Keyword checks are leads, not a novelty certificate.", + "precommit_refresh": { + "canonical_main": "e54523517d0f03e58352e647c403a5af3e525a57", + "no_new_overlapping_claim_found": true, + "merged_search": "Exact one-step, threshold-ratio, shifted threshold and general polynomial/exponential context; #6109 is a different source-specific compiler-grid binding." + } + } +} diff --git a/research/shifted-persistence-threshold/VERIFY.json b/research/shifted-persistence-threshold/VERIFY.json new file mode 100644 index 0000000000..966a1c15c2 --- /dev/null +++ b/research/shifted-persistence-threshold/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Exact shifted-power and monotonicity comparisons, all a,D=1..96 threshold pairs and three steps each, sharp/boundary/overstrong controls, invalid inputs; generated package hashes. Checks remain active under optimization." + }, + { + "argv": [ + "{python}", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Exact shifted-power and monotonicity comparisons, all a,D=1..96 threshold pairs and three steps each, sharp/boundary/overstrong controls, invalid inputs; generated package hashes. Checks remain active under optimization." + } + ] +} diff --git a/research/shifted-persistence-threshold/verify.py b/research/shifted-persistence-threshold/verify.py new file mode 100644 index 0000000000..045d0cc376 --- /dev/null +++ b/research/shifted-persistence-threshold/verify.py @@ -0,0 +1,120 @@ +#!/usr/bin/env python3 +"""Exact finite corroboration of the shifted persistence threshold. + +Produced by Nick Petalas. Apache-2.0. +The universal argument is in PROOF.md; this program uses integers only. +""" + +import hashlib +import json +import platform +import sys +from pathlib import Path + + +def require(condition: bool, message: str) -> None: + if not condition: + raise ValueError(message) + + +def threshold(a: int, degree: int) -> int: + """Return the new sufficient threshold, with D named degree.""" + if type(a) is not int or type(degree) is not int: + raise ValueError("a and D must be positive integers") + if a < 1 or degree < 1: + raise ValueError("a and D must be positive integers") + if a > degree: + return 1 + return max(2, (3 * degree - a + 2 * a - 1) // (2 * a)) + + +def step(a: int, degree: int, m: int) -> bool: + return (m + 1) ** degree < (1 << a) * m ** degree + + +def check_shifted_power() -> dict[str, int]: + powers = 0 + decreases = 0 + for m in range(2, 257): + require((m + 1) ** (2 * m + 1) < 8 * m ** (2 * m + 1), + f"shifted power failed at {m}") + powers += 1 + for m in range(1, 256): + # Cross-multiply F(m)>F(m+1), without logarithms or floats. + left = (m + 1) ** (4 * m + 4) + right = m ** (2 * m + 1) * (m + 2) ** (2 * m + 3) + require(left > right, f"shifted decrease failed at {m}") + decreases += 1 + return {"shifted_power_cases": powers, "decrease_cases": decreases} + + +def check_thresholds() -> dict[str, int]: + parameters = 0 + steps = 0 + drops = 0 + for a in range(1, 97): + for degree in range(1, 97): + new = threshold(a, degree) + old = (27 * degree + 17 * a - 1) // (17 * a) + require(new <= old, f"threshold worsened at {a},{degree}") + if a <= degree: + require(a * (2 * new + 1) >= 3 * degree, + "shifted exponent hypothesis missing") + for m in range(new, new + 3): + require(step(a, degree, m), f"step failed at {a},{degree},{m}") + steps += 1 + drops += int(new < old) + parameters += 1 + return {"parameter_pairs": parameters, "step_cases": steps, + "strict_threshold_drops": drops} + + +def check_controls() -> dict[str, int]: + controls = ( + (threshold(1, 5) == 7, "new first working example missing"), + (step(1, 5, 7) and not step(1, 5, 6), "seven not sharp"), + (threshold(2, 5) == 4, "second example changed"), + (step(2, 5, 4) and not step(2, 5, 3), "four not sharp"), + (not step(1, 1, 1), "strict equality was accepted"), + (threshold(1, 1) == 2, "m=1 equality exception missing"), + (threshold(2, 1) == 1 and step(2, 1, 1), "m=1 success missing"), + (threshold(1, 10) == 15 and step(1, 10, 14), "threshold not necessary"), + # A smaller, unproved 7/5 slope would propose m=8 at D=6,a=1. + (not step(1, 6, 8), "overstrong slope control did not reject"), + ) + for condition, message in controls: + require(condition, message) + invalid = ((0, 1), (1, 0), (-1, 1), (1, -1), + (True, 1), (1, False), (1.0, 1), (1, "1")) + rejected = 0 + for a, degree in invalid: + try: + threshold(a, degree) + except ValueError as error: + require(str(error) == "a and D must be positive integers", + "wrong rejection reason") + rejected += 1 + else: + raise ValueError("invalid input accepted") + return {"semantic_controls": len(controls), "invalid_input_controls": rejected} + + +def main() -> None: + require(len(sys.argv) == 1, "usage: verify.py") + counts = {} + counts.update(check_shifted_power()) + counts.update(check_thresholds()) + counts.update(check_controls()) + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", + "VERIFY.json", "verify.py") + hashes = {name: hashlib.sha256((package / name).read_bytes()).hexdigest() + for name in names} + print(json.dumps({"status": "PASS_SHIFTED_PERSISTENCE_THRESHOLD", + "claim_type": "scoped proof with finite corroboration", + "counts": counts, "python": platform.python_version(), + "package_sha256": hashes}, sort_keys=True)) + + +if __name__ == "__main__": + main()