From 66e05cf6c6058cff8a41a9b3ebe5945f5e36e9be Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Fri, 13 Nov 2026 22:51:17 +0000 Subject: [PATCH] feat(research): prove restored four-cycle cost ten --- .../restored-unsigned-four-cycle/README.md | 215 +++++++++++++++ .../restored-unsigned-four-cycle/SOURCES.json | 42 +++ .../restored-unsigned-four-cycle/TASK.json | 77 ++++++ .../restored-unsigned-four-cycle/VERIFY.json | 39 +++ .../restored-unsigned-four-cycle/verify.py | 250 ++++++++++++++++++ 5 files changed, 623 insertions(+) create mode 100644 research/restored-unsigned-four-cycle/README.md create mode 100644 research/restored-unsigned-four-cycle/SOURCES.json create mode 100644 research/restored-unsigned-four-cycle/TASK.json create mode 100644 research/restored-unsigned-four-cycle/VERIFY.json create mode 100644 research/restored-unsigned-four-cycle/verify.py diff --git a/research/restored-unsigned-four-cycle/README.md b/research/restored-unsigned-four-cycle/README.md new file mode 100644 index 0000000000..11170f6e12 --- /dev/null +++ b/research/restored-unsigned-four-cycle/README.md @@ -0,0 +1,215 @@ +# An ordinary four-cycle costs exactly ten with restored dirty donors + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written proof with an exact finite exclusion certificate. +The minimum scalar arithmetic cost of + +```text +(x0,x1,x2,x3) -> (x1,x2,x3,x0) +``` + +is **ten primitives**, even with any finite number of additional arbitrary +dirty registers that must each finish with their own initial value. The +target is the ordinary four-cycle, with no output sign changes. The result +also applies to its inverse and coordinate relabellings. + +This answers one new instance of Philipp / mightyOil's +[PR #1303](https://github.com/CrocSwap/integer-mult-bounds/pull/1303), second +Open next question, about further restored-permutation gaps. That package's +disjoint two-plus-three-cycle theorem and signed-four-cycle control are cited +predecessors, not results replayed here. We use its two unchanged, credited +metric-ball engines on the new ordinary-four-cycle endpoint only, apart from +small implementation controls. The new contribution is the endpoint +exclusion, its unbounded-donor application and the resulting exact price. + +## Exact interface + +Each register initially contains an arbitrary independent real scalar. One +paid primitive is a distinct-register ADD or SUB, unary NEG, DOUBLE or HALVE, +COPY, or CLEAR. There are no free signs, renamings, initialized cells or +discarded coordinates. Every donor is restored individually. Intermediate +rows may be arbitrary dyadic linear combinations. The model and read-only +specialization originate in Ross Richardson's +[#1216](https://github.com/CrocSwap/integer-mult-bounds/pull/1216) and +[#1145](https://github.com/CrocSwap/integer-mult-bounds/pull/1145). + +## Reduction to a finite six-register question + +The complete required map is invertible, so a distinct-register COPY or +CLEAR cannot occur: it loses matrix rank permanently. Delete self-COPY. +Every remaining prefix is invertible over the dyadic rationals. + +The cycle-write lemma of #1303 implies that at least five writes target the +four moved coordinates. For completeness, if all four were written just +once, consider the first such write, to coordinate i. Its only write would +have to produce its final row e_p(i). Coordinate p(i) is still untouched and +has that same row, contradicting prefix invertibility. + +A written restored donor needs at least two writes, as in #1216. Before its +first write it has its original basis row. A nonidentity unary scale changes +it, and an ADD or SUB changes it by a nonzero source row. A single write +therefore cannot restore it. A putative word of length at most nine can write +to at most `floor((9-5)/2)=2` donors. + +All other donors are read-only. Specialize their independent inputs to zero +and remove their zero-source additions. The universal endpoint identity +still holds on the retained coordinates, and the reduced arithmetic word +has no greater length. This is a lower-bound existence reduction, not a +permission to initialize actual workspace for free. Embed the resulting +word in six registers by leaving missing donors idle. + +Reduce `Z[1/2]` modulo three. ADD and SUB remain elementary row additions; +NEG, DOUBLE and HALVE all reduce to row negation. The inverse-closed +six-register generating set has `6+2*6*5=66` elements. Thus it suffices to +exclude the modular endpoint with rows + +```text +P = (e1,e2,e3,e0,e4,e5), encoded as 123045. +``` + +## Complete new endpoint exclusion + +Let B be the entire radius-four ball about identity in that metric, with +minimum distances. A word through length eight exists exactly when `AP` +belongs to B for some A in B. A word through length nine exists exactly when +that direct meet succeeds or `gAP` belongs to B for some A in B and generator g. +Indeed write `P=UhV`, where U and V have length at most four and h is one +generator, then take `A=U^-1` and `g=h^-1`. The converse constructs the word +from such a hit. Shorter words are covered by the direct meet. No determinant, +write-order, symmetry or sampling pruning enters the scan. + +Both native representations independently enumerate the complete ball and +scan this new endpoint. Each obtains + +```text +radius layers 1, 66, 2655, 83270, 2213925 +states 2299917 +generators 66 +middle transitions 151794522 = 2299917 * 66 +direct hits 0 +middle hits 0 +``` + +The verifier compares the full sorted matrix/distance streams byte for byte, +then hashes that common stream. One engine uses base-three row tables in a +64-bit matrix key; the other uses two-bit entries in a 128-bit key and literal +coordinate updates. Their generation and multiplication implementations +remain the credited source bytes. The repeated ball cardinality is a +prerequisite of the new endpoint query, not a new claim about that ball. +All nine-step modular words are excluded. The preceding reduction transfers +that finite exclusion to every finite number of restored dirty donors. + +## Matching exact rational upper word + +The first four operations swap coordinates zero and one. The remaining six +cycle coordinates one, two and three, using the predecessor's elementary +swap and three-cycle templates. Their overlapping composition gives the +new endpoint without a temporary register: + +```text +x0 += x1 +x1 -= x0 +x0 += x1 +x1 = -x1 +x3 -= x2 +x1 -= x3 +x2 += x3 +x3 += x1 +x1 -= x3 +x1 += x2 +``` + +The checker multiplies the literal rational row operations on every one of +six independent input columns, verifies both donors are unchanged, checks +the inverse word, and rejects all ten single-operation omissions. This upper +witness together with the exclusion proves the exact minimum ten. + +## Reproduce and evidence boundary + +From the repository root, with CPython 3.12 and a C++17 compiler named `c++` +supporting `unsigned __int128`: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/restored-unsigned-four-cycle +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/restored-unsigned-four-cycle --check-source-history +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/restored-unsigned-four-cycle/verify.py +``` + +The registered normal and optimized commands both run the complete new +endpoint exclusion, with no quick mode. Expected status is +`PASS_RESTORED_UNSIGNED_FOUR_CYCLE`, `scalar_minimum=10`. A standalone export +needs this directory and the four declared live source files; its verifier +uses no Git or network. `SOURCES.json` authenticates those source bytes before +compilation. The normal metadata launcher separately authenticates their Git +pins and the originating catalogue. Historical provenance is not scientific +acceptance. + +An independently represented dense Python radius-four ball supplies small +implementation controls. Both native engines must match every one of its +matrix/distance pairs for the identity and one-/two-negation endpoints. They +must reject invalid dimension and repeated-column domains. Six damaged +endpoint reports are rejected, including missing middle transitions, an +alleged hit, wrong target and a boolean substituted for a dimension. Explicit +exceptions retain all checks under optimized Python. + +Replay prints a generated receipt bound to the hashes of every package file +and every live source. `--emit /absolute/path/outside/repository/receipt.json` +also writes it to a new file. Temporary binaries, metric balls and reports +are removed on exit; no receipt or transient output is written in the checkout. +The source code, metadata and full finite query are the reproducible evidence. + +This is an exact scalar boundary result. It does not bind a current native +four-cycle caller, remove a paid recursive child, supply a physical frame or +tape layout, or improve kappa. A changed composite boundary, promised inputs, +clean/disposable workspace, free monomial maps, arbitrary scalar multipliers, +joint complex-component arithmetic or nonlinear gates are different models. +Selected #7000 is unchanged. Full supplier, precision, hosting, compiler and +outer-theorem obligations are unrun. Independent human and formal proof-kernel +review are unclaimed. Hosted CI status belongs in the PR body. + +## Open next questions + +1. Can an actual four-cycle boundary and an adjacent scalar run be synthesized + below the isolated price ten? First pin that complete caller map and its + physical frame and ownership ledger. No such caller is supplied here. +2. Can a write-pattern or support invariant replace the large finite ball for + this exclusion? Start with this fixed endpoint and allow mixed intermediate + rows. A complete symbolic certificate is missing. This package authorizes + no larger permutation search and stops at the first exact new price. + +The motivations, first steps and blockers are also in `TASK.json`. + +## Credit and implementation constraints + +Philipp / mightyOil #1303 supplied the cycle-sensitive reduction and ternary +engine, and extended Ross Richardson's #1216 packed engine with the middle +scan. Ross Richardson #1216/#1145 supplied the restored-donor model, +read-only specialization, modular method and elementary upper templates. +ToikY's historical #969 and the credited Sagar Thakrar, faw01, Jeremy Kothe, +Chafik Boukhalfa, icekylinx and supplier lineage retain their predecessor credit. +No predecessor file or notice is modified. The finite-group metric and +matrix identities use elementary classical methods; no literature-wide +priority claim is made. + +The new Python wrapper has no recursion, dynamic code evaluation or external +callbacks. Its loops have fixed finite domains or explicit byte bounds. The +native domain is fixed to six registers/radius four for the scientific query +and two registers for controls, with 60-second compilation and 180-second +execution limits. At most two six-register metric-ball files coexist. Native compilation +uses `-Wall -Wextra -Werror`; Python runs warning-strict in normal and optimized +modes. Separate static type analysis is not claimed. + +Power of Ten deviations are restricted to the managed Python runtime and +unchanged frozen source engines. Rule 3: dynamic integers, containers and +native hash tables remain, bounded here by the fixed domain and the explicit +`sum(66^k,k=0..4)` state bound, 1 MiB source-file limits and bounded report/ball +reads. Runtime allocator overhead is not measured. A future physical lowering +needs a fixed-storage representation. Rule 4: the inherited native `main` +functions exceed sixty lines. Editing frozen source for a refactor would expand +this result's scope; the wrapper keeps their byte pins and independent complete +stream comparison. A separately authorized engine refactor can address that. +Rule 10: the packed engine's existing 128-bit extension prevents portable +pedantic ISO-only compilation; the warning-strict C++17 builds and explicit +compiler requirement are retained. No warning is suppressed and no native +source change is made here. diff --git a/research/restored-unsigned-four-cycle/SOURCES.json b/research/restored-unsigned-four-cycle/SOURCES.json new file mode 100644 index 0000000000..03c88aa3f7 --- /dev/null +++ b/research/restored-unsigned-four-cycle/SOURCES.json @@ -0,0 +1,42 @@ +{ + "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/complex-restored-borrowed-boundaries/PROOF.md", + "usage": "input", + "git_blob": "a78b1f09f31f5d2d29652ddde795598e41789b72", + "sha256": "7808f30e28508e327f68fafdc0a1be58c779d892482d3713c767fd7c0d21e4b0" + }, + { + "path": "research/restored-cycle-gap/README.md", + "usage": "input", + "git_blob": "332a5de8a5130cc9f854cf8900cda178780adc44", + "sha256": "583bb8453cdd1aaf78307dd9db20d2e16f11db7638109464bcc94f6792327ccd" + }, + { + "path": "research/restored-cycle-gap/packed.cpp", + "usage": "input", + "git_blob": "c61013136cccb4e79d593f730c32d957a55613f3", + "sha256": "8ca8361756b87eabbe79bb438324ab20941b8c4ff2967be4f7a444feb9ea9232" + }, + { + "path": "research/restored-cycle-gap/ternary.cpp", + "usage": "input", + "git_blob": "97757bcc42940fe3c3399e14afb16fec75b033fe", + "sha256": "f6f64206c2269a21f571cc2de64c64fb73b5cee9af89de9347d5e38b0dcaa41f" + } + ] +} diff --git a/research/restored-unsigned-four-cycle/TASK.json b/research/restored-unsigned-four-cycle/TASK.json new file mode 100644 index 0000000000..4e1c27d9f9 --- /dev/null +++ b/research/restored-unsigned-four-cycle/TASK.json @@ -0,0 +1,77 @@ +{ + "schema_version": 1, + "task_id": "connector-alphabet-change", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "connector-alphabet-change", + "question": "Does one explicit extension of the connector alphabet offer a favorable completed budget?", + "starting_points": [ + "docs/research/research-family-status.md", + "research/universal-connector-boundary/README.md", + "certificates/selected-result.json" + ], + "methods": [ + "Construct and charge a legal extra operation on a minimal instance.", + "Prove a target-specific bound after adding one specified operation family." + ], + "acceptance_gate": "State which fixed-alphabet premise changes and charge its implementation; do not declare it free. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "first_step": { + "command": [ + "python3", + "-B", + "research/universal-connector-boundary/verify.py" + ], + "expected": "PASS_UNIVERSAL_CONNECTOR_BOUNDARY", + "inspect": "Reproduce the 945-pairing control, then read Exact interface to list the allowed calls.", + "scope": "Positive control / source-bound orientation only; this is not a new construction or full cold replay." + }, + "first_experiment": "Add exactly one legally priced operation and test a tiny dirty-input instance before enumerating larger cases.", + "bottleneck_link": "A new legal connector operation could change recursive interface cost; a larger census in the same alphabet is a separate side result.", + "allowed_variations": [ + "Choose one additional operation and a small source count for its first counterexample." + ], + "scope_change_triggers": [ + "Keeping the alphabet and only increasing the source count; record this as a changed assignment.", + "Extending a source-count census without naming a supplier/interface decision it could change; audit #2973 pruning concerns before relying on the affected predecessor exclusions." + ], + "overlap_terms": [ + "universal connector", + "source-toggle", + "connector alphabet" + ] + }, + "scope_status": "changed", + "actual_scope": "Determine the exact ordinary four-cycle arithmetic cost with any finite number of restored arbitrary-dirty donors.", + "scope_change_reason": "The source handoff asks for another restored-permutation gap. This retains its arithmetic alphabet and changes the connector card to an exact scalar boundary-price side result, rather than an alphabet extension.", + "bottleneck_link": "Restored workspace can change a recursive boundary price. This exact scalar price constrains that boundary contract only; no current supplier or paid recursive saving is asserted.", + "budget_minutes": 60, + "stop_rule": "Stop at the first exact new endpoint price, or publish the precise remaining obstruction. Do not extend to other permutation targets.", + "outcome": "completed", + "evidence": "Two source-credited native representations exclude all six-register F3 words through length nine for 123045; exact rational ten-step word, independent dense controls and generated hash-bound receipts.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can an actual four-cycle boundary be synthesized jointly with its adjacent scalar run below the isolated price ten?", + "why_it_matters": "The isolated optimum does not price a changed composite boundary.", + "first_step": "Pin a literal caller requiring this ordinary four-cycle, extract the adjacent complete linear map and compare fully restored words.", + "blocked_by": "No current source-bound four-cycle caller or physical frame/ownership ledger is supplied here." + }, + { + "question": "What structural invariant can exclude short restored permutation words without rebuilding a large finite metric ball?", + "why_it_matters": "The present donor reduction is finite but can become expensive for larger endpoints.", + "first_step": "Use the ordinary four-cycle exclusion as a fixed test case for a stronger write-pattern or support invariant, preserving mixed intermediate rows.", + "blocked_by": "A complete symbolic classification or independently checkable shorter certificate is missing; no larger search is part of this result." + } + ], + "coordination": { + "claim_url": "https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19601570", + "source_pr": 1303, + "source_author": "mightyOil", + "predecessor_author": "mightyOil", + "upstream_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "selected_record": "7000", + "scope": "Exact scalar arithmetic boundary only; selected frontier unchanged." + } +} diff --git a/research/restored-unsigned-four-cycle/VERIFY.json b/research/restored-unsigned-four-cycle/VERIFY.json new file mode 100644 index 0000000000..e6900b6587 --- /dev/null +++ b/research/restored-unsigned-four-cycle/VERIFY.json @@ -0,0 +1,39 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/complex-restored-borrowed-boundaries/PROOF.md", + "research/restored-cycle-gap/README.md", + "research/restored-cycle-gap/packed.cpp", + "research/restored-cycle-gap/ternary.cpp" + ], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 540, + "checks": "Complete new four-cycle endpoint exclusion with both native encodings, bytewise metric-ball equality, rational upper word/inverse/omissions, dense controls and rejection controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 540, + "checks": "The same complete new-endpoint certificate with optimization enabled; all checks use explicit exceptions." + } + ] +} diff --git a/research/restored-unsigned-four-cycle/verify.py b/research/restored-unsigned-four-cycle/verify.py new file mode 100644 index 0000000000..c234f6a5e8 --- /dev/null +++ b/research/restored-unsigned-four-cycle/verify.py @@ -0,0 +1,250 @@ +#!/usr/bin/env python3 +"""Check the new four-cycle endpoint; write only to temporary storage.""" + +import argparse +from collections import deque +from fractions import Fraction +import hashlib +import json +from pathlib import Path +import shutil +import struct +import subprocess +import tempfile + + +PACKAGE = Path(__file__).resolve().parent +ROOT = PACKAGE.parents[1] +SOURCE = "research/restored-cycle-gap/" +MAX_BALL_BYTES = 9 * sum(66**depth for depth in range(5)) +WORD = ( + (0, 1, 1), (1, 0, -1), (0, 1, 1), (1, 1, -1), + (3, 2, -1), (1, 3, -1), (2, 3, 1), + (3, 1, 1), (1, 3, -1), (1, 2, 1), +) + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def sha256(path): + require(path.is_file() and not path.is_symlink(), "regular file required") + require(path.stat().st_size <= 1024 * 1024, "source exceeds 1 MiB") + return hashlib.sha256(path.read_bytes()).hexdigest() + + +def authenticate_sources(): + sources = json.loads((PACKAGE / "SOURCES.json").read_text()) + expected = { + SOURCE + "README.md", SOURCE + "ternary.cpp", SOURCE + "packed.cpp", + "research/complex-restored-borrowed-boundaries/PROOF.md", + } + rows = [row for row in sources["files"] if row["usage"] == "input"] + require(len(rows) == len(expected), "unexpected source inventory") + require({row["path"] for row in rows} == expected, "source paths differ") + hashes = {} + for row in rows: + digest = sha256(ROOT / row["path"]) + require(digest == row["sha256"], "source hash mismatch: " + row["path"]) + hashes[row["path"]] = digest + return hashes + + +def dense_change(matrix, n, target, source, sign): + result = list(matrix) + for column in range(n): + offset = target * n + column + value = matrix[offset] + result[offset] = ((-value) if target == source else + value + sign * matrix[source * n + column]) % 3 + return tuple(result) + + +def dense_control_ball(): + n = 2 + identity = (1, 0, 0, 1) + distance = {identity: 0} + queue = deque([identity]) + # At most 3^4 matrices, with six generators and radius four. + for _ in range(3**4): + if not queue: + break + matrix = queue.popleft() + if distance[matrix] == 4: + continue + for target in range(n): + for source in range(n): + for sign in (-1, 1): + if target == source and sign == 1: + continue + next_matrix = dense_change(matrix, n, target, source, sign) + if next_matrix not in distance: + distance[next_matrix] = distance[matrix] + 1 + queue.append(next_matrix) + require(not queue, "control worklist exhausted") + encoded = {} + for matrix, depth in distance.items(): + key = sum(value * 3**index for index, value in enumerate(matrix)) + encoded[key] = depth + return encoded + + +def rational_map(word): + rows = [[Fraction(int(i == j)) for j in range(6)] for i in range(6)] + for target, source, sign in word: + if target == source: + rows[target] = [-entry for entry in rows[target]] + else: + rows[target] = [left + sign * right + for left, right in zip(rows[target], rows[source])] + return rows + + +def check_upper_word(): + permutation = (1, 2, 3, 0, 4, 5) + target = [[Fraction(int(j == permutation[i])) for j in range(6)] + for i in range(6)] + require(rational_map(WORD) == target, "ten-step rational endpoint failed") + for omitted in range(len(WORD)): + shorter = WORD[:omitted] + WORD[omitted + 1:] + require(rational_map(shorter) != target, "omission was not detected") + inverse = tuple((t, s, sign if t == s else -sign) + for t, s, sign in reversed(WORD)) + require(rational_map(WORD + inverse) == rational_map(()), "inverse failed") + return {"length": len(WORD), "independent_input_columns": 6, + "omissions_rejected": len(WORD), "inverse_checked": True} + + +def compile_engine(name, directory, compiler): + executable = directory / name + command = [compiler, "-std=c++17", "-O3", "-Wall", "-Wextra", "-Werror", + str(ROOT / (SOURCE + name + ".cpp")), "-o", str(executable)] + subprocess.run(command, check=True, capture_output=True, text=True, timeout=60) + return executable + + +def run_engine(executable, n, permutation, directory, label): + ball = directory / (label + ".bin") + report = directory / (label + ".json") + completed = subprocess.run( + [str(executable), str(n), permutation, str(ball), str(report)], + check=True, capture_output=True, text=True, timeout=180, + ) + require(completed.stdout.startswith("PASS_"), "missing native completion") + require(report.stat().st_size <= 4096, "oversize native report") + require(ball.stat().st_size <= MAX_BALL_BYTES, "oversize metric ball") + return json.loads(report.read_text()), ball + + +def compare_balls(left, right): + require(left.stat().st_size == right.stat().st_size, "ball lengths differ") + digest = hashlib.sha256() + with left.open("rb") as a, right.open("rb") as b: + for _ in range(MAX_BALL_BYTES // 65536 + 2): + first, second = a.read(65536), b.read(65536) + require(first == second, "native metric balls differ") + if not first: + return digest.hexdigest() + digest.update(first) + raise ValueError("ball comparison exceeded bound") + + +def control_runs(executable, directory, oracle): + for number, (permutation, minimum) in enumerate((('01', 0), ('a1', 1), ('ab', 2))): + report, ball = run_engine(executable, 2, permutation, directory, "small" + str(number)) + require(report["minimum_through_nine"] == minimum, "control distance differs") + payload = ball.read_bytes() + require(len(payload) == 9 * len(oracle), "control cardinality differs") + entries = list(struct.iter_unpack("