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
Scoped algebraic proof with an exact free-associative polynomial certificate and finite corroboration, produced by Nick Petalas. One restored arbitrary dirty spare removes the principal-demand reachability obstruction over every associative unital ring, including infinite and noncommutative rings.
The new step is the eight-ADD sufficiency word from witnesses
x=a beta,y=b beta,beta=sx+ty. It restores all original dirt columns and the source. It only requires(1-sa-tb) beta=0, so beta may be a zero divisor and the chosensa+tbneed not equal one. The necessary left-ideal invariant and two-insertion echo retain aliromman #5310 and predecessor credit.For the polynomial demand
(1+uv,u²)over every field, this resolves the feasibility part of Nick Petalas #5211's explicit restored-spare question. The displayed word has exact abstract pricemu_2+2c_0+2c_1+4c_2, giving 108 at the stated prices versus the cited original two-row optimum 202. The workspace contracts differ. Eight ADDs is an upper bound, not a shortest-word or three-row tariff theorem. No new kappa or selected-frontier change is claimed.Only the six files in
research/principal-demand-dirty-spare/are added. Advance CLAIM. Its proposed ten-ADD bound improves to eight in the first verified construction; the exact tariff remains open.Evidence
Before, #5211 supplies a two-row polynomial obstruction and leaves one restored spare open. After, a written ordered-ring proof and a literal full-state word establish the construction and arbitrary-ring insertion-count criterion.
At head
d20c1b062da1b4eae37db73098eab97f9a3e38c0, local CPython 3.12.15 with the standard library passes:(2,2,4).(beta,a,b,s,t)over Z/4 and UT2(F2), respectively 1,024 and 32,768 substitutions, checking every original dirt/source column and inverse. There are 192 and 6,720 nonzero valid witnesses, including 48 and 4,704 whose chosensa+tb != 1. A further 3,420 selected M2(F2) witnesses pass, including 2,160 with that inequality. These are tests of the new word; predecessor scientific results are cited without replay.Reproduce from the repository root, substituting another CPython 3.12 path if needed:
Expected markers:
PASS_PRINCIPAL_DEMAND_DIRTY_SPARE,PASS_REGISTERED_RESEARCH_PACKAGE,PASS_RESEARCH_COMMIT_BYTES. All registered mathematical commands ran locally; none is deferred to CI.Scope, sources and limitations
The universal classification rests on the written proof. The finite polynomial certificate proves the stated algebraic identity; finite-ring substitutions corroborate the specified domains. Independent human and formal proof-kernel review are unclaimed. No shortest ADD count, complete all-price three-row tariff, native coefficient preparation, physical spare lifetime, source access/routing, precision/tape implementation, stock, compiler closure, supplier admission or complete multiplication theorem is supplied. All five selected framework assumptions remain. No selected cold replay, predecessor scientific replay, native suite, Lean or Docker run was required or run.
Canonical main was freshly fetched and remains
e54523517d0f03e58352e647c403a5af3e525a57. The selected record is #7000 at conditional kappa 0.00363005817; the revision-8 catalogue still describes #5599. TASK.json explicitly changes the bit-helper-contract card to this algebraic boundary question. The source-binding positive control passed and is not a selected scientific replay. SOURCES.json pins source text as historical provenance; no live external scientific input is imported.Credit Nick Petalas #5211 for the question and cited two-row obstruction, lee-phys #5139/#5089 for the principal-ideal interface, aliromman #5310 for the finite associative-ring source-count theorem and its all-ring necessary/two-insertion arguments, krzysztofwojt #5045 for source-count/return classification, Nick Petalas #4916 for the ring-valued contract, and RossRichardson, 1337isnot1337, anthonylei, ofennell-quipex, tekuuu and the retained fanout lineage. Nick Petalas #6280 is related dyadic dual-exchange precedent. Elementary stabilization and row algebra are classical; no global literature-priority claim is made. Frozen predecessor files are unchanged.
Live open/account PRs, recent handoffs and active Discussions, all-main README searches for the object, exact word price and general-ring criterion, and merged/all-state PR searches were inspected before claiming and refreshed before committing. Cached remote coverage reports complete pagination of 846 open PRs and 7,480 Discussion records; the sparse local scan covers 222 of 10,178 tracked notes. Unpublished work and arbitrary historical diffs are outside that coverage. The sole main-predecessor source is older account PR #5211; recent account fanout results below are related comparisons, not the question source or reused main step.
Open next questions
(2,2,4)ADD vector, preserve all three dirt columns and classify arbitrary words. No matching lower bound is supplied here.Related open work
#7514 prices a three-row binary common-value fanout with changing tariffs across its single source call. This construction uses stationary abstract prices and arbitrary ring-valued unequal demands; it reuses none of that result and computes no common optimum.
#7265 proves a four-demand Boolean single-insertion ADD minimum with no spare. This result adds a restored zero-demand row to two demands over arbitrary rings and makes no competing ADD-optimality claim.
#7183 prices a nonprincipal three-row radical demand on a directed cycle using two insertions. The new sufficiency concerns principal two-row demands with a restored spare and unrestricted elementary row directions; no common numerical optimum is computed.
#1865 schedules commuting C3 fanout rewrites in a selected scalar word. This abstract ring construction supplies neither those native rewrites nor a changed paid profile or ceiling.
#7548 bounds completed-target rounding error for a two-factor dirty commutator. This result concerns exact ring-valued source-insertion feasibility and supplies no rounded implementation or competing error value.
The completion check read this account's other open PRs created since the CLAIM: #7548, #7549, #7550, #7551, #7552, #7553 and #7554. The adjacent rounding result is listed above; the others concern fixed phase-B packing, cactus query acquisition, dual-polar cuts, integer-gauge optimization, an ordinary four-cycle and modular phase-cache memory. None computes this principal-demand source-count criterion or a competing number. No additional computation checked another contribution.
CI notes
CI did not certify this package. At unchanged head
d20c1b062da1b4eae37db73098eab97f9a3e38c0, run 43521997914, plan job 132218321527, failed inOnboarding helper tests. I read the completed checks once and inspected the actual job log. It reportsRan 760 testsandFAILED (failures=1, skipped=24). The sole failing test is:The mismatch is inherited from canonical main
e54523517d0f03e58352e647c403a5af3e525a57. I read those Git objects directly:certificates/selected-result.jsonnamesmake frontier7000-verify, whiledocs/ci-verification.mdstill hasCurrent selected-family replay: #6030andmake frontier6030-verify. The selected record, CI document and failing test have no diff between that base and this head.The dependent package replay job 132220403655 was skipped because
planfailed. Hosted CI executed no package replay. All mathematical replay, source-binding and export evidence above remains local.I independently inspected the failed-job logs for rohanarun's run 42905094314, job 130140894651 and dillona's run 42903313790, job 130134720799. Each has the same sole failing test, missing-command assertion, 760-test total and 24 skips. No claim is made here about other runs whose logs were not inspected.
No fix, retrigger commit, push, shared-file edit or workflow rerun was made. Maintainer repair of main is separate from this contribution.
Merge Danger
Door: two-way.
Blast Radius: isolated.
Six new research-package files only. Shared code, frozen sources and the selected frontier are unchanged.