Repository navigation
Cache radical-fanout inverses: 1,661,435 fewer tuple.index calls - #6232
Merged
Mister-Meeseeks merged 1 commit intoOct 30, 2026
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Adds an original verifier implementation step: the complete radical-fanout workload makes 260
tuple.indexcalls instead of 1,661,695, with byte-identical complete output. Claim type: exact implementation-work reduction, a scoped equivalence argument and finite conformance evidence. No new mathematical tariff, kappa or selected-frontier change.The new frozen adapter adds at most 162 tuple entries per ring. The 260 count includes table construction; construction also adds one membership test per element. Nonunit inverse requests retain the original exception path. There is no cached verdict or omitted case. The predecessor executable and README are retained byte for byte with their published blob/SHA256/author metadata, so cold replay needs no unmerged commit or network.
The new adapter, checker and benchmark were produced by Nick Petalas. lee-phys retains the theorem, complete workload, interpreter and search from #6210. Retain its #5259/#5514 interpreter/search credit, Ali Romman, Krzysztof Wojt, Ross Richardson, Cinna Davis and the full lineage in the unchanged source notice.
Evidence
Before, each inverse query searches a fixed row. After, the exact complete-workload tuple-index count decreases by 1,661,435. The independent new conformance layer checks 322 element/index cases and sixteen controls, including exact exception behavior, invalid tables and corrupt-source rejection before import.
6fcd968e3899b567f520b5b05bde6c481dd7581a754026af2aa300bf6396da1d.913b61836ecc4c20ff59935424719177f1362723.Reproduce from the repository root with CPython 3.12 and the standard library:
Any CPython 3.12 path can replace the displayed interpreter.
IMB_RUN_ROOTmay name an existing private scratch directory. The checker prints a generated receipt bound to actual package hashes; no expected receipt is handwritten. Child bytecode namespaces are fresh and temporary.Limitations and unrun obligations
This is an isolated optional replay implementation, not a review of the predecessor mathematics. Ring order is capped at 81. Only successful inverse lookups and negations receive constant-time tuple access; nonunit errors retain a row search. The exact work-count reduction does not establish a portable runtime gain or a faster multiplication algorithm.
No predecessor package, shared runner or selected result is changed. Physical/native/compiler/stock/precision/outer admission, selected scientific cold replay and all five framework assumptions remain outside scope. No Lean or Docker run, independent human review or formal proof-kernel review is claimed. The engineering-mode playbook is Autonomous local run.
Open next questions
Does the unchanged complete command show a stable wall-time gain on an idle Linux CPython 3.12 host? Run five or more alternating pairs with
benchmark.py, retain every output digest, and report medians and ranges. An additional host measurement is missing. A source-level ring-factory hook is a possible later integration step; no further optimization is reserved.Related open work
Completion refresh on October 30 found no currently open PR studying this exact radical-triple replay or inverse-table implementation in the bounded R16/fanout searches. This account has two open PRs, and neither was created since the advance CLAIM at 2026-10-29T22:12:25Z. There is no new same-object account PR to add or common-instance numerical conflict to report; no extra computations were run to check other results.
The other open text-search hits study cubic repairs at arity sixteen, C3 schedules or centre-path sharing. These are different objects. Bounded text searches do not establish novelty.
CI notes
Both
planandreplay (research/radical-fanout-inverse-tables)passed at commit913b61836ecc4c20ff59935424719177f1362723in run 40965485648. The completed checks were read once, and the run's successful conclusion and exact head were confirmed. A maintainer has merged this PR.Both registered local modes, byte/source-history checks and read-only Git-free modes also pass. CI checks the registered conformance workload, not a host-specific runtime threshold or the full multiplication theorem. The advance claim and the narrower delivered scope are recorded in the claim and progress update.
Merge danger
Two-way change, isolated to
research/radical-fanout-inverse-tables/. Existing scientific packages and the selected frontier are unchanged.