Repository navigation
Prove a complete funding obstruction for two-owner native multigraphs - #5507
Merged
Mister-Meeseeks merged 2 commits intoOct 25, 2026
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.
Proves a scoped obstruction for the #5456 funding model with arbitrary parallel two-owner classes and mixed Q/D fields. The uniform theorem gives at most
2cQ fields forcfour-support calls; a genuine three-coordinate spectral exception is compensated globally by the native-chain requirement. No finite search is used as a substitute for the uniform argument.The actual retained source invoice selects 222 distinct early helper owners across 111 ports, leaves 217 untouched helpers per call, and bounds target rank by
5066cagainst paid rank5129c. Under the stated independent-axis tariff hypotheses this excludes a positive funding margin for every0 < s <= 1. It does not establish a universal mechanism barrier, native implementation, or new κ.Validation: normal and optimized registered replay and controls pass; 4,164 small spectral cases, 103 graph fixtures, exact constructed endpoints, and direct helper-owner accounting corroborate the proof. Missing and type-corrupt receipts are rejected. Committed-byte/source-history validation, explicit-input-ref export integrity, and read-only Git-free normal/optimized replays pass. Independent agent proof review is bound to head
1691a6024b60bdf28d7a2eed13cb32d78e2ea5b4and reports no blockers; this is not proof-kernel or human certification.Canonical investigation: #5501