Skip to content

P104 structure laws: credit cut law, SPEC-forced legality, owned deletion bound, contract odd-rank classes, helper floors (no κ) - #7555

Open
DreamingOfClouds wants to merge 3 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/p104-structure-laws
Open

DreamingOfClouds wants to merge 3 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/p104-structure-laws

Conversation

@DreamingOfClouds

Copy link
Copy Markdown
Contributor

This package states five general laws that bound changes to the P104 invoice. Each law comes with its scope and an exact checker written against the standard library only, and each checker runs controls that must fail. It makes no κ claim and builds no word. The census numbers are statements about Clear1nsight's #7334 word, vendored unmodified and authenticated by SHA256.

Results

  1. Credit/cut law for credited public fields.
    • Loss identity: paid − credit = 2·Σ(descent depth) under Fourier-rank pricing d(E,F), laterals included.
    • Two-sided cut law on every up-set U:
      • junk_U ≤ o_in + p_out, which needs invertible T;
      • cout_U ≤ o_out + p_out.
    • Consequences:
      • a zero-loss credited field supplies no cut capacity;
      • a credited public substitute for an owned entry of depth k pays ≥ 2k, against k for the owned entry.
    • On Conditional κ = 0.00364665195644: fuse helper 319’s paid lifts #7334:
      • all 6,232 public MOVEs ascend and all 73 owned lifetimes are monotone;
      • on every one of the 501 principal up-sets with an owned entry, need_in = o_in with zero slack (2,032 forced entry incidences).
  2. Legality is forced by the specification.
    • The specification fixes the complex label space as F₂ʰ with the ordinary dot product, with terminal labels X: U_a → 𝓕 and Y: 0 → U_a^⊥. The checker matches that text verbatim.
    • Over all Lagrangians at h = 4 and 5:
      • the charts are exactly the Lagrangians split by (L₀, L_F);
      • the x_p and y_t cones share a frame iff p·t = 0.
    • Alternatives:
      • any other symmetric Gram M costs rank(M+I);
      • an alternating form cannot express an endpoint relation;
      • moving a Y end costs 2 per end.
  3. Owned-unit deletion bound. For exact 8-term decoders in PR968's normal form on punctured E8 units:
    • cst ≥ 56 − E(p), with E(p) = 0 for p ≤ 24, 1 at 25, 2 for 26–35, and 6 for 36–38;
    • so cst = 48 is impossible for every n ≥ 82, and cst ≥ 54 for n ≥ 85.
    • With Z16 kept in the puncture, E_Z = 0 up to p = 34.
    • The checker reproduces PR968's hyperplane-normal census (440,880 normals) from scratch and runs a complete union enumeration.
  4. Odd-rank classes of per-port contracts.
    • Classification: modulo q-even monomials there are 5 classes, plus 3 monomial classes.
    • o = r everywhere: the σ-rank equals the rank of the q-odd part.
    • Contract bills must range over q-even W.
    • The per-J odd unit is an integer rank deficit, not a parity.
    • Equality clause: rank-additive factorisations of a σ-factor that is −1 on Im(g − I) consist of involutions. This is proved, and checked exhaustively on small groups.
    • Hub bound: a rank-h hub on n ports forces ≥ rank(Odd)·(n − h) transfers outside the hub, which is 96 per unit at h = 8, n = 104.
  5. Helper-layer lower bounds on Conditional κ = 0.00364665195644: fuse helper 319’s paid lifts #7334.

Checks

python3.12 -B scripts/research_package.py --package research/p104-structure-laws → PASS_REGISTERED_RESEARCH_PACKAGE. That is five commands, taking about 5 minutes locally.

Caveats

  • These are lower bounds and structural laws. Nothing here is a construction or an attainment claim.
  • Law 1 assumes the net-credit rule and excludes words with singular T. Lateral or net-down credit is out of scope.
  • Law 2 takes the specification's target, its terminal labels and the L₀-fixing rank-0 adapters as given.
  • Law 3 is limited to 8-term decoders and p ≤ 38. The hyperplane-flat classification is quoted as a standard fact.
  • Law 4's counts 17, 36, 104 and 8 are parameters.
  • Law 5's floors use per-frame ranks only, so they cannot certify near-optimality. The 1,367.08 floor holds only under its endpoint premise.
  • The branch carries Clear1nsight's two CI prerequisite commits (from the Pin the historical selected replay to its inspected commit #7257 line), with authorship kept.
  • No human has reviewed the package.

Credit: Clear1nsight (#7334), Rohan Arun (#7113 caller), ToikY (price and replay lineage), PR968's authors, and icekylinx (chart notes). See NOTICE.

— DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code

🤖 Generated with Claude Code

Clear1nsight and others added 3 commits November 13, 2026 16:23
This is the exact documentation prerequisite retained by CrocSwap#7156. It points the onboarding check to the selected CrocSwap#7000/CrocSwap#7001 review. Credit to Rohan Arun and the source authors.
The PR CrocSwap#6292 rejection census and package plan are statements about 2485805. Load its exact sources and planner in a private sparse checkout, keeping all source hashes, 19 expected rejections, nine package selections and the empty-plan control. Subsequent edits to the live Makefile and CI guide no longer invalidate this historical check.

The original audit is by unpaidmoon, building on Dennis’s historical replay gate. The pinned repository view follows the precedent of Matarener’s PR CrocSwap#5434. Repair prepared with substantial OpenAI Codex assistance.
…deletion bound, contract odd-rank classes, helper floors (no kappa)

Five general laws with exact standard-library checkers and biting controls:
the credit/cut law with its zero-slack census on all 511 principal up-sets
of CrocSwap#7334; dot-product legality forced by the specification over all
Lagrangians at h = 4, 5; cst >= 56 - E(p) for exact 8-term decoders on
punctured E8 units (cst = 48 impossible for n >= 82); odd-rank classes of
per-port contracts with the equality clause and the general hub bound; and
sound (944.07 D0) and conditional (1,367.08 D0) floors on CrocSwap#7334's 9,983.73
helper layer. No kappa claim.

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