Repository navigation
Conversation
Four reusable checked recovery and byte-entry modules with explicit restricted coverage.
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.
Coverage and checked context
Explicit author-checked kappa = 836330098538459/500000000000000000 = 0.001672660197076918, at upstream main 0b1cccf. These generic components do not change that exponent.
Four unchanged checked modules recover a permutation/inverse and binary chart certificate from packed columns plus update/form vectors, connect it to an actual named JSON field, and connect both calls/owners and recovery to original byte arrays.
Finite coverage: arbitrary finite dimensions including zero; recovery completeness is restricted to one involutive rank-one update after a coordinate permutation. Arbitrary invertibility is insufficient, and no efficient uniform recovery cost is asserted.
Conditional-interface coverage: successful byte execution exposes the installed UTF-8/JSON parser equations, exact named-field AST, independent column operator and both inverse laws. Auxiliary certificate data are generated internally. Parser standards, lexical/duplicate-key policy, actual selected-file success, key/digest provenance and update/form provenance remain explicit obligations.
Full-theorem coverage: this does not supply complex phases, affine shifts, physical execution/allocation/direction, precision, recursive cost accounting or the all-size multiplication/runtime theorem.
Validation and reproduction
Four new sources total 30,860 bytes. Fifteen standard-only axiom probes and seven complete printed theorem types passed local kernel checks and independent exact-source/terminal review. The public manifest binds unchanged source hashes and observed evidence. Lean 4.21.0 and Mathlib 308445d7985027f538e281e18df29ca16ede2ba3 are pinned.
REPRODUCTION.md describes a fresh isolated serial 17-module source closure. It was inspected, not executed again for publication. No extra local CI preflight was run. Thin selected L450 applications and canonical owner exports are excluded.
Dependencies, overlap and credit
Thirteen unchanged prerequisites are reused by immutable reference, without copying: PR #1831 at 542f914; PR #1879 at 981afe7; PR #1927 at a5838af. Compared with those parser/chart/JSON adapters, the new work generates the restricted certificate from actual columns and supplies byte-entrypoint composition. No broad novelty claim is made.
Credit: Lean/Mathlib authors; Jeremy Kothe T16/PR514 and PR484/507 lineage; Rohan Arun PR1094; predecessor strict-parser, permutation, gather and chart work. James Chang with OpenAI assistance; Apache-2.0. Existing source comments and attribution are preserved.
Next useful obligation: connect exact compact column fragments to the decoded named field, while retaining parser and provenance limits explicitly.