Skip to content

D-CE64-CYCLE-0 + D-PUZZLE-ATTN-0: cross-cycle state, and entropy as the focus of attention on crosswords - #1397

Merged
AdaWorldAPI merged 3 commits into
mainfrom
claude/epistemicstate5-ce64-bits-3oe0dq
Oct 7, 2026
Merged

AdaWorldAPI merged 3 commits into
mainfrom
claude/epistemicstate5-ce64-bits-3oe0dq

Conversation

@AdaWorldAPI

@AdaWorldAPI AdaWorldAPI commented Oct 7, 2026 •

Copy link
Copy Markdown
Owner

This PR carries two probes. Neither changes production code, and both run under CI (test = true).

1. D-CE64-CYCLE-0: what a CE64 register must carry across cycles

The D-CE64-STAUNEN-0 executor (lance-graph-planner/examples/staunen_scheduler_probe.rs) is extended, not duplicated:

  • run_with(opts)
  • a lazy-stamp heap scheduler
  • a FIFO worklist baseline, which reacts to new evidence but reads no entropy and no activation
  • a 350 ms wall-clock budget per window, with continuation
  • Forget arms at window boundaries
  • the D-PEARL-IO-0: Pearl's ladder executed in and out of CausalEdge64 #1390 Simpson population with its positive trial
  • end-attractor and fold-quadrant readings
  • dense windows of 1k..1M folds

The comparative tests pool three seeds.

State forgotten at every window boundary:

forgotten resolved verdict
nothing 0.955 —
posterior / H 0.955, identical run derived, so persisting it would be an echo
bits 40..42 0.955, identical run an echo of the opcode
register (Epi5) 0.024 needed
evidence table 0.000 needed
attention state 0.378 needed: this is how earlier windows direct later ones

W: belief moved on 4648 folds and Epi5 on 72; revise never changed F/C.

Baselines (pooled, 3 seeds):

policy resolved wake (windows) folds
full 0.865 7.9 4806
FIFO 0.909 8.3 5400
round-robin 0.911 7.5 5400

Correction to #1395: the "wake 4.2 vs 5.1" there was one seed. Pooled, the full scheduler is no faster to wake, and both simple baselines resolve more. What survives: it uses 11% fewer folds and wastes half as many on settled basins.

1M folds per window: FIFO runs about 220 ns per fold, so a full million fits in ~252 ms. The heap scheduler runs about 800 ns per fold and is cut at ~440k folds per 350 ms window. Within a window, later folds are less productive (0.95 → 0.48).

2. D-PUZZLE-ATTN-0 — moved to #1398

The crossword attention commits were pushed after this PR merged, so none of them are in it. They are now in #1398.

Falsifiers

tests disable runs
CYCLE-0 23 19

Every disable run went red on its named falsifier.

Limitations

  • The heap scheduler costs ~3.5× FIFO per fold.
  • Moore, EWA and Sudoku folds are not in the CE64 loop.

Board: the CYCLE-0 entry, the #1395 arc entry and LATEST_STATE, and status rows.

🤖 Generated with Claude Code

https://claude.ai/code/session_0177nSSyQaXqbNuGR1vMXXN6

claude added 3 commits October 7, 2026 22:23
…eduler

run_with(opts): heap scheduler (lazy stamps), FIFO worklist baseline,
wall-clock window budget with continuation, Forget arms at window
boundaries (belief, question bits, register, evidence, attention),
#1390 Simpson+trial population, fold quadrants, polarity, end
attractors, productive/redundant/rejected accounting, dense 1k..1M
fold windows. Comparative tests now pool three seeds.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0177nSSyQaXqbNuGR1vMXXN6
…ake claim

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0177nSSyQaXqbNuGR1vMXXN6
@coderabbitai

coderabbitai Bot commented Oct 7, 2026 •

Copy link
Copy Markdown

Review in Change Stack →

Note

Currently processing new changes in this PR. This may take a few minutes, please wait...

⚙️ Run configuration
  • Configuration used: Organization UI
  • Review profile: CHILL
  • Plan: Essentials
  • Run ID: c64a5280-3497-40b3-ae59-5049086475ce
📥 Commits

Reviewing files that changed from the base of the PR and between 5658c10 and ea16f16.

📒 Files selected for processing (6)
  • .claude/board/LATEST_STATE.md
  • .claude/board/PR_ARC_INVENTORY.md
  • .claude/board/STATUS_BOARD.md
  • .claude/board/entries/2026-10-07-ce64-cycle-0-cross-cycle-executor.md
  • .claude/board/entries/README.md
  • crates/lance-graph-planner/examples/staunen_scheduler_probe.rs
 ________________________________
< My GPUs mine bugs, not Crypto. >
 --------------------------------
  \
   \   \
        \ /\
        ( )
      .( o ).
✨ Finishing Touches
📝 Generate docstrings
  • Commit to this branch
  • Create a new PR
  • Autopilot · Keep fixing CodeRabbit findings and required CI, and resolving merge conflicts

Warning

Billing warning: we have not been able to collect payment for this subscription for more than 72 hours. Please update the payment method or pay any pending invoices in Billing to avoid service interruption.


Comment @coderabbitai help to get the list of available commands.

@coderabbitai

coderabbitai Bot commented Oct 7, 2026

Copy link
Copy Markdown

Add Carrot credits or activate Agent usage billing to use Autopilot

@AdaWorldAPI
AdaWorldAPI marked this pull request as ready for review October 7, 2026 22:53
@chatgpt-codex-connector

chatgpt-codex-connector Bot commented Oct 7, 2026 •

Copy link
Copy Markdown

Codex Review Summary

This comment shows the latest Codex review activity on this pull request.

Review Status Commit Review trigger
📝 Code Review ✅ Completed 2026-10-07T22:55:13.623589Z ea16f16 Draft marked ready
ℹ️ About Codex in GitHub

Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you

  • Open a pull request for review
  • Mark a draft as ready
  • Comment "@codex review" or "@codex security review".

Codex reacts with 👀 while any review is running, comments if it has suggestions, and reacts with 👍 once all reviews finish with no findings.

@AdaWorldAPI
AdaWorldAPI merged commit 4a0a72c into main Oct 7, 2026
9 of 10 checks passed

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: ea16f1643f

ℹ️ About Codex in GitHub

Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you

  • Open a pull request for review
  • Mark a draft as ready
  • Comment "@codex review".

If Codex has suggestions, it will comment; otherwise it will react with 👍.

Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".

Comment on lines +1337 to +1338
rep.belief_updates_no_epi +=
u64::from(!epi_moved && (dh.is_some_and(|d| d.abs() > eps) || st.activation != 0));

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P1 Badge Measure posterior changes directly for the W counter

belief_updates_no_epi does not actually count belief updates: a nonzero st.activation from Fold::Confound increments it even though the non-hydration branch never changes b.belief, while two different posteriors can have equal entropy and a zero/quantized activation and therefore be missed. Consequently the reported “4648 belief moves” and the derived conclusion about how many updates W would reference are not supported; record and compare the posterior before and after each fold instead.

Useful? React with 👍 / 👎.

Comment on lines +1169 to +1175
Forget::Attention => {
b.habit = 0.0;
b.progress = PROGRESS_PRIOR;
b.coh = 0.0;
b.prev_act = 0;
b.surprise = 0.0;
}

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P1 Badge Reset entropy history when forgetting attention

The Forget::Attention experiment retains h_prev_end, even though that cross-window value is the input used to calculate the next learning-progress sample at lines 1397–1400. Thus this arm still carries learned attention history across every boundary, so its measured resolution cannot establish what happens when attention is actually forgotten; reset h_prev_end to a neutral/rebuilt value along with progress.

Useful? React with 👍 / 👎.

Comment on lines 1257 to +1259
let epoch = ((w * EPOCHS as u64) / s.windows.max(1)) as usize;
let last_epoch = epoch >= EPOCHS - 1 || s.windows < EPOCHS as u64;
let t0 = Instant::now();

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P2 Badge Include all per-window work in the deadline measurement

For the dense 327,680-basin runs, the 350 ms “per-window” clock starts only after event delivery and the full agg initialization pass, and window_ns is captured before the full end-of-window update/requeue pass. Both omitted sections are O(number of basins), so a window can exceed the advertised cap and the printed max ms/w and folds/s can materially understate its runtime; start timing before world.events and check/record through the post-processing pass.

AGENTS.md reference: AGENTS.md:L24-L27

Useful? React with 👍 / 👎.

@AdaWorldAPI AdaWorldAPI changed the title D-CE64-CYCLE-0: what a CE64 register must carry across cycles, and what self-orchestration buys at 1M folds D-CE64-CYCLE-0 + D-PUZZLE-ATTN-0: cross-cycle state, and entropy as the focus of attention on crosswords Oct 7, 2026
AdaWorldAPI pushed a commit that referenced this pull request Oct 7, 2026
…ped)

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0177nSSyQaXqbNuGR1vMXXN6
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