test: adinkra orbits classify members - dynamical zeta over a code-preserving map - #9163
Merged
Merged
Conversation
…e-preserving map (shadow*) Next-rung #3 (Aaron: 2→3→1). Ties the adinkra member-identity thread (#9157) to the scheduler dynamical zeta (#9151): a CODE-PRESERVING round-map on GF(2)^8 keeps every member's purpose-codeword a valid identity, and the Artin–Mazur zeta of that map — restricted to the [8,4,4] adinkra code — has periodic ORBITS that partition the 16 member-identities into PURPOSE CLASSES. The round-map is a code AUTOMORPHISM: a coordinate permutation π with π(C)=C (found by exhaustive search over Zeta.Core.AdinkraCode). Identity-preserving dynamics — no member is ever mapped to a non-identity. tests/Tests.FSharp/AdinkraOrbits.Tests.fs (3/3): • the round-map is a code automorphism (preserves the code; every identity stays one); • its dynamical zeta self-verifies: exp(Σ Fix(π^k)u^k/k) = Π_orbit 1/(1−u^|O|) — the same Fix-count-vs-orbit-decomposition discipline as #9151; • the orbits partition the 16 members into purpose classes (Σ lengths = 16, a genuinely dynamical orbit ≥ 2, the quiescent all-zero identity its own fixed class). Confirms the exact machinery next-rung #1 (formalize the CHIP-8/IScheduler predictor) needs — a finite map's Artin–Mazur zeta whose orbits classify its configs. RESUME updated (#3 landed). Anchors: Gates (adinkras ↔ doubly-even codes); Artin–Mazur 1965; the [8,4,4] automorphism group AGL(3,2). Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> AgencySignature-v1: persona: otto actor: zeta-otto surface: tests topology: shadow-clone intent: adinkra-orbits-classify-members-dynamical-zeta-over-code-preserving-automorphism authorization: aaron-explicit-2-then-3-then-1-2026-07-02 uncertainty: low measure: code-automorphism-preserves-adinkra-code-dynamical-zeta-fix-eq-orbit-product-orbits-partition-16-members-into-purpose-classes-3-tests delta-u: adinkra-identity-tied-to-scheduler-dynamical-zeta-orbits-classify-members-machinery-for-chip8-confirmed seed: S4
|
You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard. |
AceHack
added a commit
that referenced
this pull request
Jul 2, 2026
…real VM step-map (shadow*) (#9165) Next-rung #1 (Aaron: 2→3→1; "we already have chip8/IScheduler predicting itself but ad-hoc, not this formal math based; the periodic orbits are the cheat-engine's memory-space orbits = character loops"). The confirming machinery came from #9151/#9163. The REAL Chip8.step (src/Core/Chip8.fs; deterministic without RND) is a map on the VM state; on a fixed ROM the reachable state set is FINITE, so a looping animation is literally a PERIODIC ORBIT, and the Artin–Mazur zeta of the reachable step-map ENUMERATES it — the formal, math-grounded version of the ad-hoc cheat-engine orbit detection. tests/Tests.FSharp/Chip8DynamicalZeta.Tests.fs (2/2): a tiny real ROM — the period-4 counter V0 ← (V0+1) AND 3 — has a full-state loop-map with one transient (V1 unset) feeding a 4-cycle (the character loop). ζ = exp(Σ Fix(f^k)u^k/k) = 1/(1−u⁴), self-verified (fixed-point counts of the iterated REAL-VM reachable map vs. the single orbit — the #9151/#9163 discipline), and the orbit length IS the character period. This is exactly the orbit the ad-hoc Chip8PredictionRoom look-ahead traverses; the zeta makes it visible/known. Completes Aaron's 2→3→1: #9161 (weighted catalog zeta), #9163 (adinkra orbits classify members), and this (CHIP-8 dynamical zeta formalizing the predictor). RESUME updated; remaining routed step = wire the zeta into the live soft IScheduler for run-ahead self-prediction. Anchors: Artin–Mazur 1965; Chip8.step; Chip8PredictionRoom / PredictionScheduler. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> AgencySignature-v1: persona: otto actor: zeta-otto surface: tests topology: shadow-clone intent: formalize-chip8-self-prediction-artin-mazur-zeta-of-real-vm-step-map-character-loop-orbit authorization: aaron-explicit-2-then-3-then-1-2026-07-02 uncertainty: low measure: real-chip8-step-period-4-counter-rom-reachable-map-artin-mazur-zeta-1-over-1-u4-self-verified-orbit-is-character-loop-period-2-tests delta-u: ad-hoc-chip8-predictor-formalized-memory-character-loop-is-a-periodic-orbit-zeta-enumerates-it-2-3-1-complete seed: S4
AceHack
added a commit
that referenced
this pull request
Jul 2, 2026
…eduler (self-prediction) (shadow*) (#9172) The capstone (Aaron: "wire the zeta into the soft IScheduler"; RESUME step 4). A DoP=1, seed-fixed soft-scheduler tick is a deterministic map on state (run(1)==run(N) — CellScheduler's law). SchedulerZeta carries the Artin–Mazur zeta at the scheduler layer so the loop can PREDICT ITS OWN RECURRENCE SPECTRUM before running the full budget. src/Core/SchedulerZeta.fs: • predict key step start — RUN-AHEAD self-prediction: iterate the tick (through a finite projection `key`) only until a state repeats (never the caller's whole budget), report the orbit the run settles into (Transient, Period, Reachable). The loop modelling its own recurrence before it happens. • zetaOfRun / zetaOfOrbits — the Artin–Mazur zeta (1/(1−u^Period) for a run; Π over orbits for a spectrum), integer series. • spectrum / fixCount — the FULL recurrence spectrum over an enumerable config space, self-verifying (exp(Σ Fix f^k) = Π orbits). tests/Tests.FSharp/SchedulerZeta.Tests.fs (3/3): • the soft scheduler predicts its own REAL CHIP-8 recurrence (period 4) by run-ahead, without a large budget, and its predicted zeta = 1/(1−u⁴); • the recurrence spectrum self-verifies (exp Σ Fix = Π orbits) on a config-map with known cycles (0 1 2)(3 4)(5)(6) ⇒ orbit lengths {3,2,1,1}; • a deterministic cell-round map's period is recovered exactly. This is the formal, math-grounded basis for the ad-hoc CHIP-8/IScheduler self-prediction Aaron described — the zeta ENUMERATES the memory character-loops the ad-hoc scanner finds. RESUME step 4 (capstone) landed; the ζ name-audition trajectory is complete. Anchors: Artin–Mazur 1965; SoftScheduler/CellScheduler (the DoP=1 deterministic tick); Chip8.step; #9151 (scheduler zeta), #9165 (CHIP-8 zeta), #9163 (orbit-classification). Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> AgencySignature-v1: persona: otto actor: zeta-otto surface: src/core topology: shadow-clone intent: wire-dynamical-zeta-into-soft-scheduler-run-ahead-self-prediction-schedulerzeta-module authorization: aaron-explicit-wire-the-zeta-into-the-soft-ischeduler-2026-07-02 uncertainty: low measure: schedulerzeta-predict-run-ahead-real-chip8-period-4-without-full-budget-spectrum-self-verifies-exp-fix-eq-orbit-product-deterministic-round-period-exact-3-tests delta-u: capstone-zeta-wired-into-soft-scheduler-loop-predicts-own-recurrence-before-running-name-audition-trajectory-complete seed: S4
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
1 participant
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.
Next-rung #3 (of your 2 to 3 to 1). Ties the adinkra member-identity thread (#9157) to the scheduler dynamical zeta (#9151): a code-preserving round-map on GF(2)^8 keeps every member's purpose-codeword a valid identity, and the Artin-Mazur zeta of that map - restricted to the [8,4,4] adinkra code - has periodic orbits that partition the 16 member-identities into PURPOSE CLASSES.
The round-map is a code AUTOMORPHISM (coordinate permutation with pi(C)=C, found by exhaustive search over Zeta.Core.AdinkraCode). Identity-preserving dynamics.
3/3:
Confirms the exact machinery next-rung #1 (CHIP-8 predictor) needs. RESUME updated. Anchors: Gates; Artin-Mazur 1965; AGL(3,2).
Generated with Claude Code