Repository navigation
Conversation
This was referenced Nov 13, 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.
Summary
Prove an exact closed acquisition optimum for arbitrary binary target subspaces when the available queries are the edges of a simple cactus graph. The claim is a scoped written proof with exact finite corroboration and a bounded constructive optimizer, produced by Nick Petalas. No new kappa or physical supplier is claimed.
Bridges have fixed coefficients. Every cycle has one independent common row shift, so its exact bill is total edge price minus the largest equal-row bucket price. Cycles may share vertices. The formula has no small target-rank or codimension hypothesis. The constructor and certificate checker run in polynomial time, without enumerating target superspaces.
aliromman #5791 supplies the whole-span acquisition interface and partial-target question. Classical graphic cycle spaces, parity and weighted grouping retain credit. The new contribution is the arbitrary-target cactus formula, attaining reconstruction and certificate. Nick Petalas #5878 and #6654 are related general-pool approximation and small-codimension results; their results, algorithms and code are not used as the new step. No predecessor scientific verifier is replayed. Literature-wide priority is unclaimed.
Advance CLAIM. Canonical main was refreshed before commitment and remains
e54523517d0f03e58352e647c403a5af3e525a57; selected #7000 and all five framework assumptions remain unchanged. Only seven files inresearch/cactus-partial-query/are added.Evidence
Before, #5791's whole-span cheapest basis did not optimize this partial-target contract. On the new triangle fixture with prices 4,3,2, pruning that basis pays five for a target whose direct acquisition costs four. The new theorem gives the exact optimum on every cactus, including arbitrary target rank, disconnected graphs, zero prices and dependent targets.
Local CPython 3.12.15 normal and optimized warning-strict replay passes with identical generated receipts:
The normal and optimized direct commands took 4.07 and 4.30 seconds locally, respectively, below their separate 120-second registered limits. These measurements establish timeout headroom, not a speedup. Both registered commands, metadata/provenance pins, exact committed-byte/mode/source-history checks, official seven-file export integrity and normal/optimized read-only Git-free export replay pass. Generated receipts bind all seven package files. The verifier writes no persistent output. No local verification is deferred to CI.
From the repository root, reproduce with the exact local interpreter path:
Another CPython 3.12 path may replace the absolute path. Standard library only. Expected markers are
PASS_CACTUS_PARTIAL_QUERY,PASS_REGISTERED_RESEARCH_PACKAGE, andPASS_RESEARCH_COMMIT_BYTES. The README documents problem JSON, certificate generation/checking and resource bounds.Limitations and unrun obligations
The proof is binary and requires every edge to belong to at most one simple cycle. General overlapping-cycle graphs are outside scope. It permits nonnegative real prices; the executable admits integer prices through 10^12, 1..128 vertices, at most 192 edges and 128 target columns. Unsupported inputs and infeasible targets reject explicitly.
This is additive acquisition only. Linear reconstruction is free in the declared relaxation. Source access, reconstruction XORs, physical delivery, chronology, dirty restoration, native frames, ownership, storage, precision/tape, stock and a complete paid/productive supplier invoice remain unpriced and unproved. No selected scientific cold replay, native build, Lean or Docker run, complete multiplication theorem or selected-frontier change is supplied. Independent human and formal proof-kernel review are unclaimed. The card's physical caller and full signed-invoice gate is not met.
Open next questions
Related open work
Targeted live open/merged searches, current claims, all-main README searches and the cached overlap helper found no open cactus acquisition result in the inspected coverage. The helper covered 846 open PRs and 7,482 Discussion records with complete pagination; its sparse local coverage was 207 of 10,178 note paths. These checks do not establish novelty against unpublished work or all historical diffs.
Completion refresh read this account's seven other open PRs created since the CLAIM: #7547, #7548, #7549, #7551, #7552, #7553 and #7554. They concern restored-spare insertion, rounded commutator error, phase-B packing, dual-polar cuts, integer gauges, restored permutations and modular phase-cache memory. None computes this weighted cactus partial-acquisition optimum. No further scientific computations or numerical comparisons were run for this check.
CI notes
CI did not certify this package. At unchanged head
e09a1fcb75db18c22d8e5b69775ef18f4f8840ef, run 43522410008 failed in plan, Onboarding helper tests. I read the completed checks once and inspected the job log. It reports exactly one failure among 760 tests, with 24 skipped:test_research_current_status.CurrentCiNavigationTests.test_current_ci_section_matches_selected_recordThe AssertionError says that
`make frontier7000-verify`was not found in the CI verification document. The package replay job was skipped because plan failed. No hosted package replay or package failure is inferred.I inspected both base-main blobs at
e54523517d0f03e58352e647c403a5af3e525a57:certificates/selected-result.jsonnamesmake frontier7000-verify, whiledocs/ci-verification.mdstill describes #6030 andmake frontier6030-verify. This PR changes neither file. The mismatch is already present on main.I also inspected the failed-job logs for all three runs below. Each independently reports the same exact failing test, missing
make frontier7000-verifyassertion, 760 tests, one failure and 24 skipped:Verification evidence remains local, as listed above. No fix or retrigger commit, push, shared-file edit or job rerun was made during closeout. The repository-level repair is left to maintainers.
Merge danger
Door: two-way. Seven additive files in one isolated research package.
Blast radius: package. No shared implementation, frozen predecessor, workflow or selected-result files change.