Repository navigation
Add inverse-aware universal certificates for dirty linear circuits (no new κ) - #5262
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Conversation
This was referenced Oct 23, 2026
This was referenced Oct 23, 2026
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.
Programs that cancel a named operator against its actual inverse need the relation-aware frontend explicitly left open by #5235. This adds a self-contained inverse-aware certificate package: a pair of complete dirty linear programs with r inputs and q unary occurrences uses r+q states, certifies every returned role for every invertible substitution and payload dimension, and produces explicit unipotent counterexamples on failure.
The written proof compiles inverses into finite feedback equations, supplies exact invariant-subspace certificates, and uses a central-parameter rational identity to justify arbitrary invertible substitutions. A separately transcribed checker imports no producer code and performs no elimination. The package includes rational/prime-field arithmetic, literal reduced-word and matrix oracles, CLI examples, and inspectable matrix witnesses. No predecessor source or shared repository code changes.
Validation on CPython 3.12.12:
Hosted run 39971793532 passed both the shared planning tests and the focused Linux package replay on exact head
6f92ccf1e61c4668c8ee687bd1df8b42932b8759. Hosted execution is not independent scientific acceptance.Claim type: scoped written proof and author-checked implementation, not independent human or proof-kernel verification. Only named-generator inverse relations are covered. Additional relations, typed rectangular/native adapters, phases, rounding, precision, stock, hosting, tapes and the full supplier bill remain separate. No new kappa, supplier admission or selected-frontier change.
Start at
research/inverse-dirty-certificates/README.mdand the proof. Reproduce withpython3.12 -B scripts/research_package.py --package research/inverse-dirty-certificates.Fresh main base:
ff3cc58e370d0f678e529246f8c73e8094e18fcf, priority revision 7. Exact contribution head:6f92ccf1e61c4668c8ee687bd1df8b42932b8759. Main and #5235's source head were refreshed and unchanged; live claims and PR bodies were checked again immediately before publication. Canonical scoped claim / handoff.Credit zxv #5235 (
48976daa4dce59b4867ef046da72a370e389925d) for the independent-operator register bridge and this open inverse-frontend question; its dirty-echo/tensor/dirty-phase predecessors retain their full attribution in the package. Recognizable rational-series, Magnus and weighted-automata methods retain classical credit (Schutzenberger/Fliess, Kiefer, and the cited literature). No new general PIT algorithm or global literature priority is claimed. Prepared by Krzysztof Wójt (@krzysztofwojt) with substantial OpenAI Codex assistance, including a delegated exact-oracle implementation; Apache-2.0.