Skip to content

Research: T185 dirty-entry and frame-refit screens on the #2863/#2894 words (negative result, no κ) - #2904

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
digitalis-p:research/t185-dirty-entry-frame-screens
Oct 16, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
digitalis-p:research/t185-dirty-entry-frame-screens

Conversation

@digitalis-p

Copy link
Copy Markdown
Contributor

Summary

Negative result. No κ claim. The selected record is unchanged.

This package bounds the most direct native-word lever left after #2863 proved the fixed-inventory packing optimum: letting more helpers enter dirty while every existing gate stays fixed. The words screened are:

Word Result
PR2857 base/extra 0 of 184 eligible helpers have a frame-feasible dirty entry, in both direct and pre-only modes
PR2894 base/extra 0 of 182
One-hop relays, all four words 8 apparent relays (409, 411, 413, 415, 425, 427, 429, 431), 0 valid under an exact bilinear test
Frame refits (side check), all four words 0 improving: single-gate moves (345 candidates) and forward/backward cascades (2797/3009 on PR2857, 2803/3015 on PR2894)

Method

tools/wordlib.py is an independent, exact implementation:

  • the PR2833/PR2857 frame-climb ledger;
  • an adjoint pass giving every register's target-dirt response just before every program item. It reproduces the stored compensation for 402 of 408 live helpers on all six words; the six exceptions are warp-tainted initial-correction sources.

tools/entry_screen.py asks whether a helper's whole dirt response lies in the exact span of responses reachable by inserted gates r += u*q0:

  • insertion at any time up to the helper's purity horizon, in either phase;
  • partner cancellation;
  • entry at a sub-frame of the first frame;
  • frame feasibility over the full program timeline, including A/B pins, warps, restore and end frames;
  • optional one-hop relays.

tools/refit_screens.py covers fixed-word frame moves. The card lists that class as a scope-change trigger (#1995/#2013), so it is labelled a side check.

Verification

All checks are standard-library only.

python3 scripts/research_package.py --package research/t185-dirty-entry-frame-screens --check-only
python3.12 scripts/research_package.py --package research/t185-dirty-entry-frame-screens
Check Outcome
--check-only metadata PASS
Registered replay, Python 3.12.13 PASS_REGISTERED_RESEARCH_PACKAGE ... outcome=negative-result (exit 0, 414 s)
core / chains2857 / chains2894, Python 3.14 local 94 / 218 / 213 s; timeouts 300 / 450 / 450
python3 -B -m unittest discover -s tests -p 'test_research_*.py' 133 tests OK (5 skipped)
scripts/check_research_commit.py --ref c291ad5 PASS (24 files)

The core part includes these controls:

  • a corrupted compensation coefficient is detected;
  • a broken frame chain is rejected;
  • a de-optimised word (one climb split) is repaired by the refit screen;
  • the frame-relaxed subset is entirely in span;
  • the relay-validity test accepts six known relays of quartet helper 478.

make verify and the selected frontier1094 replay were not run. This package changes neither the selected construction nor any existing artifact, and CONTRIBUTING asks for affected checks only.

During development, four screen bugs produced false positives before publication. Each was caught by building the word literally or by the control. They are listed in the README; the published tools implement the corrected rules.

Independent reproduction of #2863

Recorded in evidence/T185-REPLAY.json.

  • Full cold replay: PASS (exit 0, 1507 s; CPython 3.13.16, NumPy 2.5.4, SciPy 1.18.1, SymPy 1.14.0, mpmath 1.4.1). κ = 0.001720100805416885927944 − 10⁻⁴⁶ − 10⁻⁷⁰ exactly.
    • The release receipt differs from the published one only in a wall-clock seconds field and the manifest hashes derived from it. Substituting the published native hashes and seconds reproduces the published receipt exactly.
  • Fast replay: all five stages pass.
    • The published head omits two .gitattributes files (* -text) that its MANIFEST lists, so --hash-only fails as published. Restoring them from Improve conditional κ to 0.00172009662868483 with shared kernels #2857 matches the pinned hash.
    • Under Python 3.14 the regenerated FILL.json.gz differs only in its gzip container; the decompressed payload is identical.

Scope, limits and overlap

Credit

Prepared by digitalis-p with substantial Claude (Anthropic) assistance, including two delegated agents (a census survey and the #2863 cold replay). No independent human review is claimed. Apache-2.0.

🤖 Generated with Claude Code

…no kappa)

Bounded screen of single-helper dirty entry, with every existing gate fixed, on the
CrocSwap#2863 (PR2857 shared-kernel) and CrocSwap#2894 (preload-move) supplier words. Exact adjoint
responses, full-program frame feasibility, partner cancellation, sub-frame entry,
insertions in either phase and one-hop relays with an exact bilinear validity test.

Result: 0 frame-feasible candidates on all four words; 8 apparent relays, 0 valid;
single-gate and cascade frame refits 0 improving. Calibrated: the same screen gives
exactly CrocSwap#2853's 16 quartet helpers on the PR2833 words. With frames relaxed, all 184
eligible helpers are algebraically cancellable, so frame placement is the obstruction;
CrocSwap#2894's preload re-synthesis of two zero-frame-first quartets is consistent with this.
Also records an independent fast and full cold replay of CrocSwap#2863.

Vendored inputs keep their PR2833, PR2857 and PR2894 notices. Prepared for digitalis-p
with substantial Claude (Anthropic) assistance; no independent human review claimed.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants