From de350d7e11b3a755df44564f7e3dd039ad37fe37 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Fri, 13 Nov 2026 22:51:32 +0000 Subject: [PATCH] feat(research): prove exact modular phase-cache memory --- research/modular-phase-cache/PROOF.md | 180 ++++++++++++++ research/modular-phase-cache/README.md | 127 ++++++++++ research/modular-phase-cache/SOURCES.json | 24 ++ research/modular-phase-cache/TASK.json | 73 ++++++ research/modular-phase-cache/VERIFY.json | 34 +++ research/modular-phase-cache/verify.py | 276 ++++++++++++++++++++++ 6 files changed, 714 insertions(+) create mode 100644 research/modular-phase-cache/PROOF.md create mode 100644 research/modular-phase-cache/README.md create mode 100644 research/modular-phase-cache/SOURCES.json create mode 100644 research/modular-phase-cache/TASK.json create mode 100644 research/modular-phase-cache/VERIFY.json create mode 100644 research/modular-phase-cache/verify.py diff --git a/research/modular-phase-cache/PROOF.md b/research/modular-phase-cache/PROOF.md new file mode 100644 index 0000000000..f0390faaf1 --- /dev/null +++ b/research/modular-phase-cache/PROOF.md @@ -0,0 +1,180 @@ +# Exact persistent memory for a modular phase cache + +This contribution was produced by Nick Petalas. Apache-2.0. + +## Contract and theorem + +Fix integers t>=0 and b>=1. A source x has one coefficient x_a in +Z/(2^b) for each a in F2^t. After loading x, a cache has no further access +to it. An external command i replaces the logical source coefficient x_a +by (-1)^(a_i) x_a. A read returns the sum of the current logical source, +modulo 2^b. Commands and reads can occur in any finite order, including +repetitions. Every source and every such history must be handled exactly. +The original source need not be recoverable from the cache. + +Count only the cache states that can depend on x. Program constants and +externally supplied commands are not charged as source memory. Every +source-dependent header, retained output, random seed or control state is +part of that cache. There is no uncharged source-dependent transcript. +The construction below needs no history cursor. Its read leaves the state +unchanged. Temporary arithmetic and source preparation are separate costs. + +Define + +```text +B(t,b) = sum_{j=0}^t binom(t,j) max(b-j,0). +``` + +The minimum number of persistent states is exactly 2^B(t,b). Thus the +minimum fixed binary packet width is B(t,b), even for arbitrary nonlinear +encoding and state transitions. Zero-error randomized encoding or updates +cannot reduce this state count. Here zero error means correctness with +probability one for every source and every finite history, with random +coins independent of the source before loading. + +This is a finite-ring observation theorem. It does not assert a smaller +cache for exact complex or unbounded integer outputs. + +## A complete family of observations + +Starting at x, apply exactly the commands indicated by a bit vector s +and then read. The response is + +```text +f_x(s) = sum_a (-1)^(a dot s) x_a mod 2^b. +``` + +After every later history, the logical source is again an updated x of +this form. Two sources are observationally equivalent exactly when their +complete tables f_x agree. An exact cache may merge equivalent sources; +it cannot merge sources with different tables, since one fixed command +sequence and read separates them. + +For each subset S of {0,...,t-1}, put + +```text +z_S(x) = sum_{a: S subset supp(a)} x_a. +``` + +For Boolean s, ordinary integer expansion gives + +```text +(-1)^(a dot s) = product_i (1-2 a_i s_i), +f_x(s) = sum_{S subset supp(s)} (-2)^|S| z_S(x) mod 2^b. +``` + +Evaluation of a multilinear polynomial on the Boolean cube is the +subset-zeta transform. Its matrix is triangular with diagonal one when +subsets are ordered by inclusion. Integer Mobius inversion gives its +inverse, so it remains invertible over Z/(2^b). Consequently two tables +agree if and only if every coefficient (-2)^|S| z_S agrees modulo 2^b. +For |S|=b the coefficient vanishes identically. Thus the vector of c_S +is exactly the observational equivalence class, not merely a sufficient +list of cached statistics. + +## Every packed state is attainable + +The full map x -> (z_S)_S is another subset-zeta transform: it sums over +supersets instead of subsets. It too is unimodular over the integers and +invertible modulo 2^b. + +Prescribe each c_S independently in Z/(2^(b-|S|)) for |S|=1 and b>=t, + +```text +B(t,b) = b*2^t - t*2^(t-1). +``` + +This follows from the binomial sum and its first moment. At t=2,b=3, +the exact cache width is eight bits, versus twelve bits for the literal +four-coefficient source. At t=3,b=2 it is five bits, versus sixteen. +These comparisons price only persistent modular source information. + +The modular quotient is essential. At t=1,b=2 the distinct sources +(0,0) and (2,2) have the same complete modular phase table, while their +unbounded integer sums differ. If a later caller needs source recovery, +discarded carries, exact Gaussian values or a changed query family, the +discarded information must be supplied and charged. This theorem does +not establish a saving under that stronger boundary. + +## Predecessor boundary + +Ali Romman's PR #4958 proves that the least invariant linear cache over +the complex numbers is the sum of the query ranks on joint diagonal +fibers. Its historical 56- and 112-row values are not recalculated here +and are not asserted over Z/(2^b). Its source and native lineage retain +their credit. The new step is a changed finite-ring contract, exact +observational class count allowing nonlinear states, and an attaining +variable-width cache with reversible generator updates. + +Boolean zeta/Mobius transforms, Walsh interpolation, Smith normal forms +and finite-state distinguishability are classical. The same state count +can be read from the classical Walsh Smith diagonal, whose 2^j entries +have multiplicity binom(t,j). No new classical normal-form theorem or +literature-wide priority is claimed. The elementary proof above needs no +predecessor executable or spectral certificate. diff --git a/research/modular-phase-cache/README.md b/research/modular-phase-cache/README.md new file mode 100644 index 0000000000..7ac9c0ecf4 --- /dev/null +++ b/research/modular-phase-cache/README.md @@ -0,0 +1,127 @@ +# Exact bit memory for modular phase caches + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written proof with exact finite corroboration. For a source +indexed by F2^t with coefficients modulo 2^b, the least persistent cache that +answers its sum after every sequence of coordinate sign changes has exactly + +```text +2^B(t,b) states, where B(t,b) = sum_j binom(t,j) max(b-j,0). +``` + +The lower bound permits arbitrary nonlinear states and zero-error randomized +encodings and updates. An explicit packed subset-sum cache attains it, with +reversible in-place modular updates and no separate phase cursor. For t=2, +b=3 it needs eight logical persistent bits rather than the source's twelve. +For b=2, its width is exactly t+2. The source is not required to be recoverable. +[PROOF.md](PROOF.md) defines the complete contract and proves the formula. + +The new contribution changes Ali Romman's +[PR #4958](https://github.com/CrocSwap/integer-mult-bounds/pull/4958) +characteristic-zero linear-cache interface to a finite residue ring, where +integer rank alone does not count states. Its 56- and 112-row historical +values are cited background, not computations or claims of this package. +Boolean zeta/Mobius inversion, Walsh interpolation, the classical Walsh Smith +diagonal and finite-state distinguishability retain their classical credit. +No literature-wide priority claim is made for those ingredients. + +## Reproduce + +From the repository root with standard-library CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/modular-phase-cache/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/modular-phase-cache/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/modular-phase-cache +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/modular-phase-cache --check-source-history +``` + +Another CPython 3.12 executable may replace the absolute path. The verifier is +read-only and Git-free. It emits `PASS_MODULAR_PHASE_CACHE` in a generated JSON +receipt bound to all six package files. No receipt is handwritten. The +registered normal and optimized commands have 120-second limits. + +The finite checks compare literal phase tables and subset sums with the packed +zeta encoder, enumerate every source in eleven small domains, and enumerate +every packed state in the declared small-state domain. They check image +cardinality, inverse-zeta representatives, every generator, involution, +commutation and longer histories. Larger fixtures reach t=10 and b=16. +Boundary controls reject malformed domains and states; semantic controls show +that one initial sum is insufficient and that the modular quotient cannot +recover exact integer sums. The universal result rests on the written proof. +No predecessor scientific program or certificate is replayed. + +The local CPython 3.12.15 normal and optimized checks agree on all 135,798 +enumerated sources, 337,268 source/generator transitions, 8,766 enumerated +cache states, 21,564 state/generator transitions and 17,156 commuting pairs. +They also check 220 larger fixtures, 2,200 history updates, 131 closed-form +parameter cases and eleven rejected inputs. The two direct registered +commands took 4.636 and 4.539 seconds locally. These are check durations, +not a performance comparison. The combined registered replay passed. +Three disposable implementation mutations, changing the ADD sign, omitting +negation and skipping a zeta axis, were rejected by the literal comparisons. +The longest function has 29 physical lines. No separate static-analyzer +or independent mathematical review is claimed. + +## Scope and limitations + +This is a modular observation cache, not lossless storage of the source. +Every source-dependent header or controller state counts toward the lower +bound. The upper construction has no source-dependent external transcript. +The B-bit claim counts persistent logical information. Python object sizes, +source loading, temporary arithmetic, output storage, physical movement and +instruction costs are not claimed to fit in B bits. + +There is no asserted transfer to exact complex queries, unbounded integers, +source restoration, omitted carries or the selected word. A source-preserving +physical caller and its complete invoice remain missing. No native supplier, +selected assumption discharge, new kappa, complete multiplication theorem, +independent human review or formal proof-kernel acceptance is claimed. Lean, +Docker and the selected cold replay were not run. The selected frontier and +all five framework assumptions remain unchanged. + +The historical source is pinned as provenance in [SOURCES.json](SOURCES.json). +It supplies motivation, not a live input. [TASK.json](TASK.json) records the +change from the centre-path-sharing card to this finite-ring side result. +The [advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19601590) +pins canonical base e54523517d0f03e58352e647c403a5af3e525a57, priority revision +8 and selected #7000. The first card control passed +`PASS_RESEARCH_BASELINE_BINDINGS_ONLY`; it is metadata orientation only. + +Overlap checks included live open/account PRs, recent handoffs, active +Discussions, merged searches and all-main README searches for modular phase +caches, nonlinear caches and Walsh/Smith state counts. The overlap cache +reported 846 open PRs and 7,482 Discussion records, with complete remote +pagination. Its sparse local search covered 215 of 10,178 note paths; +the all-main searches cover omitted READMEs. Arbitrary code diffs, unindexed +prose and unpublished work remain limits, and no-match is not novelty proof. + +## Open next questions + +Can one source-bound caller use only these modular observations and safely +discard the quotient kernel? First specify the output modulus, every later +read and all carry/restoration obligations. Its physical boundary and full +paid invoice are missing. The present result alone does not justify a +construction campaign. The structured question is in TASK.json. + +## Verification bounds + +The single verifier has no recursion, subprocess, network access, dynamic code +or output files. Its public constructor accepts 0<=t<=10 and 1<=b<=16. +At most 1,024 source coefficients, cache fields or layout entries are live +per construction. The source census has at most 65,536 inputs per fixture; +its transcript dictionary retains at most 4,096 records. The state census +admits at most 4,096 states per fixture. Functions stay below 60 lines. +Explicit contracts remain active with assertions disabled. File reads for +receipts are bounded at 256 KiB each. Warning-strict normal/optimized runs, +in-memory compilation and AST inspection are the available diagnostics. + +Power of Ten rule 3 deviation: CPython arithmetic and containers allocate +during evaluation. This terminating verifier bounds input dimensions, +retained dictionaries and integer widths, and claims no fixed-allocation +runtime. A fixed-storage port would need its own arithmetic and receipt +implementation before use in an allocation-prohibited environment. +Rule 9 deviation: eleven fixed no-argument rejection closures invoke the +same local validation functions. Their target set and lifetimes are bounded +by `controls`; each is executed once and its exact error is checked. diff --git a/research/modular-phase-cache/SOURCES.json b/research/modular-phase-cache/SOURCES.json new file mode 100644 index 0000000000..497870fc4a --- /dev/null +++ b/research/modular-phase-cache/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": "research/centre-polynomial-cache-limits/PROOF.md", + "usage": "provenance", + "git_blob": "98e070a4e309010d76d7885b39366f9a9ef71341", + "sha256": "ebcd0912e990c71f3b29b87674c1b5e3efa8f5ea37ed20f4fd06d80ce27f6382" + } + ] +} diff --git a/research/modular-phase-cache/TASK.json b/research/modular-phase-cache/TASK.json new file mode 100644 index 0000000000..63b64eb942 --- /dev/null +++ b/research/modular-phase-cache/TASK.json @@ -0,0 +1,73 @@ +{ + "schema_version": 1, + "task_id": "centre-path-sharing", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "centre-path-sharing", + "question": "Can a specified persistent boundary eliminate a repeated centre operation in the current 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": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Write a two-call input/output contract on the current source word, including arbitrary centre baselines and every later read. Price producer, retention, native alignment and restoration jointly. Historical 64-per-call and 1.90x figures are not current budgets. Stop if a missing consumer or restored-input obligation consumes the saving; reopen only with a changed legal boundary.", + "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": [ + "centre path", + "persistent boundary", + "dirty recoding" + ], + "existing_checks": [ + { + "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": "Exact persistent state complexity and explicit reversible updates for a full modular scalar phase cache over Z/(2^b), allowing nonlinear and zero-error randomized states.", + "scope_change_reason": "An original finite-ring observation boundary replaces the source-bound characteristic-zero two-call task. This is a scoped memory side result, not a selected supplier improvement.", + "bottleneck_link": "Persistent observation memory must be priced before a phase cache can replace repeated source access. The theorem isolates what can be discarded when only modular phase sums are required; physical delivery and carry obligations remain open.", + "budget_minutes": 60, + "stop_rule": "Stop at the first proved exact memory law and its attaining cache; leave physical lowering and wider queries open.", + "outcome": "completed", + "evidence": "PROOF.md and normal/optimized read-only exact finite checks in verify.py.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can an actual source-bound caller use only the modular phase observations and discard their kernel?", + "why_it_matters": "Only such a boundary could turn the logical memory reduction into a useful physical saving.", + "first_step": "Specify its modulus, every later read, retained carries, ownership and restoration, then price preparation and complete delivery.", + "blocked_by": "No physical caller or complete paid invoice is supplied." + } + ] +} diff --git a/research/modular-phase-cache/VERIFY.json b/research/modular-phase-cache/VERIFY.json new file mode 100644 index 0000000000..c5db0df023 --- /dev/null +++ b/research/modular-phase-cache/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Literal complete phase tables, source/state cardinalities, all generator updates, surjective representatives, commuting/inverse histories and rejecting controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Literal complete phase tables, source/state cardinalities, all generator updates, surjective representatives, commuting/inverse histories and rejecting controls." + } + ] +} diff --git a/research/modular-phase-cache/verify.py b/research/modular-phase-cache/verify.py new file mode 100644 index 0000000000..a4357902b0 --- /dev/null +++ b/research/modular-phase-cache/verify.py @@ -0,0 +1,276 @@ +"""Exact modular phase-cache construction and finite conformance checks.""" + +import hashlib +import itertools +import json +import math +from pathlib import Path +import sys + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def domain(t, b): + need(type(t) is int and 0 <= t <= 10, "axis capacity") + need(type(b) is int and 1 <= b <= 16, "precision capacity") + + +def bit_count(t, b): + domain(t, b) + return sum(math.comb(t, j) * max(b - j, 0) for j in range(t + 1)) + + +def layout(t, b): + domain(t, b) + result = [] + offset = 0 + for mask in range(1 << t): + width = b - mask.bit_count() + if width > 0: + result.append((mask, width, offset)) + offset += width + need(offset == bit_count(t, b), "layout width") + return tuple(result) + + +def valid_state(state, t, b): + need(type(state) is int and 0 <= state < (1 << bit_count(t, b)), + "cache state") + + +def encode(source, t, b): + domain(t, b) + modulus = 1 << b + need(type(source) is tuple and len(source) == 1 << t, "source length") + need(all(type(x) is int and 0 <= x < modulus for x in source), + "source residue") + values = list(source) + for axis in range(t): + bit = 1 << axis + for mask in range(1 << t): + if not mask & bit: + values[mask] = (values[mask] + values[mask | bit]) % modulus + state = 0 + for mask, width, offset in layout(t, b): + state |= (values[mask] % (1 << width)) << offset + valid_state(state, t, b) + return state + + +def representative(state, t, b): + """A source attaining any packed cache state, by inverse zeta transform.""" + valid_state(state, t, b) + values = [0] * (1 << t) + for mask, width, offset in layout(t, b): + values[mask] = (state >> offset) & ((1 << width) - 1) + for axis in range(t): + bit = 1 << axis + for mask in range(1 << t): + if not mask & bit: + values[mask] = (values[mask] - values[mask | bit]) % (1 << b) + return tuple(values) + + +def flip(state, t, b, axis): + """Two ordered passes: additions first, then negate their source fields.""" + valid_state(state, t, b) + need(type(axis) is int and 0 <= axis < t, "update axis") + fields = {mask: (width, offset) for mask, width, offset in layout(t, b)} + bit = 1 << axis + updated = state + for mask, (width, offset) in fields.items(): + if not mask & bit and (mask | bit) in fields: + source_width, source_offset = fields[mask | bit] + source = (updated >> source_offset) & ((1 << source_width) - 1) + target_mask = (1 << width) - 1 + target = (updated >> offset) & target_mask + value = (target - 2 * source) & target_mask + updated = (updated & ~(target_mask << offset)) | (value << offset) + for mask, (width, offset) in fields.items(): + if mask & bit: + field_mask = (1 << width) - 1 + value = (-(updated >> offset)) & field_mask + updated = (updated & ~(field_mask << offset)) | (value << offset) + valid_state(updated, t, b) + return updated + + +def read(state, t, b): + valid_state(state, t, b) + return state & ((1 << b) - 1) + + +def literal_query(source, phase, b): + return sum((-x if (a & phase).bit_count() % 2 else x) + for a, x in enumerate(source)) % (1 << b) + + +def query_table(source, t, b): + return tuple(literal_query(source, phase, b) for phase in range(1 << t)) + + +def direct_encode(source, t, b): + """Independent literal subset sums, without zeta-transform updates.""" + state = 0 + for mask, width, offset in layout(t, b): + value = sum(x for a, x in enumerate(source) if a & mask == mask) + state |= (value % (1 << width)) << offset + return state + + +def exhaustive_sources(): + cases = [(0, 1), (0, 4), (1, 1), (1, 2), (1, 3), + (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2)] + sources = transitions = distinct = 0 + for t, b in cases: + transcripts = {} + for source in itertools.product(range(1 << b), repeat=1 << t): + state = encode(source, t, b) + table = query_table(source, t, b) + need(state == direct_encode(source, t, b), "subset encoding") + if state in transcripts: + need(transcripts[state] == table, "cache collision") + else: + transcripts[state] = table + need(read(state, t, b) == table[0], "initial read") + for axis in range(t): + changed = tuple((-x if a & (1 << axis) else x) % (1 << b) + for a, x in enumerate(source)) + updated = flip(state, t, b, axis) + need(updated == encode(changed, t, b), "literal update") + need(flip(updated, t, b, axis) == state, "involution") + transitions += 1 + sources += 1 + need(len(transcripts) == 1 << bit_count(t, b), "image cardinality") + need(len(set(transcripts.values())) == len(transcripts), + "distinct states have distinct full query tables") + distinct += len(transcripts) + return {"cases": len(cases), "sources": sources, + "source_axis_transitions": transitions, "distinct_states": distinct} + + +def exhaustive_states(): + states = transitions = comparisons = 0 + for t in range(5): + for b in range(1, 5): + if bit_count(t, b) > 12: + continue + for state in range(1 << bit_count(t, b)): + source = representative(state, t, b) + need(encode(source, t, b) == state, "surjective cache") + table = query_table(source, t, b) + for axis in range(t): + moved = flip(state, t, b, axis) + moved_table = query_table(representative(moved, t, b), t, b) + need(moved_table == tuple(table[s ^ (1 << axis)] + for s in range(1 << t)), + "query translation") + need(flip(moved, t, b, axis) == state, "state restoration") + transitions += 1 + for left in range(t): + for right in range(left): + a = flip(flip(state, t, b, left), t, b, right) + z = flip(flip(state, t, b, right), t, b, left) + need(a == z, "commuting updates") + comparisons += 1 + states += 1 + return {"states": states, "state_axis_transitions": transitions, + "commuting_pairs": comparisons} + + +def wider_histories(): + fixtures = updates = 0 + for t in range(11): + for b in (1, 2, 3, 8, 16): + for pattern in range(4): + source = tuple(((a + 1) ** (pattern + 1) + 3 * pattern) % (1 << b) + for a in range(1 << t)) + state = encode(source, t, b) + need(state == direct_encode(source, t, b), "wide subset sums") + initial = state + phase = 0 + word = tuple(range(t)) + tuple(reversed(range(t))) + for axis in word: + state = flip(state, t, b, axis) + phase ^= 1 << axis + need(read(state, t, b) == literal_query(source, phase, b), + "history read") + updates += 1 + need(state == initial and phase == 0, "whole history restoration") + fixtures += 1 + return {"fixtures": fixtures, "updates": updates} + + +def rejected(call, message): + try: + call() + except ValueError as error: + need(str(error) == message, "wrong rejection") + return 1 + raise ValueError("invalid input accepted") + + +def controls(): + count = 0 + count += rejected(lambda: bit_count(True, 2), "axis capacity") + count += rejected(lambda: bit_count(11, 2), "axis capacity") + count += rejected(lambda: bit_count(1, 0), "precision capacity") + count += rejected(lambda: bit_count(1, 17), "precision capacity") + count += rejected(lambda: encode((1,), 1, 2), "source length") + count += rejected(lambda: encode((0, 4), 1, 2), "source residue") + count += rejected(lambda: encode((True, 0), 1, 2), "source residue") + count += rejected(lambda: read(-1, 1, 2), "cache state") + count += rejected(lambda: read(1 << bit_count(2, 3), 2, 3), "cache state") + count += rejected(lambda: flip(0, 1, 2, 1), "update axis") + count += rejected(lambda: flip(0, 1, 2, False), "update axis") + x, y = (1, 0), (0, 1) + need(literal_query(x, 0, 2) == literal_query(y, 0, 2), "same initial read") + need(literal_query(x, 1, 2) != literal_query(y, 1, 2), "later separator") + need(encode((0, 0), 1, 2) == encode((2, 2), 1, 2), "true modular quotient") + need((0, 0) != (2, 2), "source erasure boundary") + state = encode((0, 1), 1, 2) + correct = flip(state, 1, 2, 0) + need(read(correct, 1, 2) == 3, "signed update fixture") + need(read(state, 1, 2) != read(correct, 1, 2), "omitted update detected") + need(bit_count(2, 3) == 8 and bit_count(3, 2) == 5, "memory examples") + return {"invalid_inputs": count} + + +def formulas(): + checks = 0 + for t in range(11): + need(bit_count(t, 1) == 1, "modulo two collapse") + need(bit_count(t, 2) == t + 2, "modulo four law") + for b in range(max(1, t), 17): + expected = b if t == 0 else b * (1 << t) - t * (1 << (t - 1)) + need(bit_count(t, b) == expected, "large precision law") + checks += 1 + return checks + + +def source_hashes(): + root = Path(__file__).resolve().parent + hashes = {} + for name in ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", + "VERIFY.json", "verify.py"): + with (root / name).open("rb") as stream: + data = stream.read(262145) + need(len(data) <= 262144, "receipt file capacity") + hashes[name] = hashlib.sha256(data).hexdigest() + return hashes + + +def main(): + need(len(sys.argv) == 1, "no arguments supported") + result = {"sources": exhaustive_sources(), "states": exhaustive_states(), + "histories": wider_histories(), "controls": controls(), + "formula_cases": formulas(), "package_sha256": source_hashes(), + "python": sys.version, "status": "PASS_MODULAR_PHASE_CACHE"} + print(json.dumps(result, sort_keys=True)) + + +if __name__ == "__main__": + main()