Repository navigation
Conversation
…lizing compiler classes
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.
Result
Prove an exact arithmetic bijection for the ordered Pascal parent/child occurrences, plus ultimate-owner resolution in at most G+1 ancestry steps, without materializing occurrence buckets.
Novelty and predecessors
#4359, #4691, #6878 establish finite compiler and layout ingredients; this makes the missing individual owner/occurrence identification explicit, preserving native and owned-field identities.
Verification
242 finite flows, 9,934 owner checks, 10 negative controls and independent literal-word review. Run python3 -I -W error -B research/pascal-occurrence-codec/verify.py.
Limits and kappa
Logical codec only: no physical routing or native service. No new kappa; 0.00363005817 remains conditional.
Credit
Prepared for @CubeJerry with substantial OpenAI assistance; credit predecessor authors and PRs as detailed in the package.
Full proof, reproducibility, negative controls and provenance: https://github.com/CubeJerry/integer-mult-bounds/tree/91246e5131152ccb1f64a969c36706360861f821/research/pascal-occurrence-codec