On this page
Dates
Created
Updated
Record idTH-20260822-leaf-memo-semantics-preserving-3bb0ac6b

No explanation has been written for this record yet.

Technical recordThe registered claim, mechanism and falsification criteriaTH-20260822-leaf-memo-semantics-preserving-3bb0ac6b
Claim
Memoising the fast fair leaf's eighteen board-only features across consecutive leaf calls with the same (board, moves_remaining), recomputing only next_disc_vertical_options, produces bit-identical leaf values, identical actions, logical work, nodes, cache hits and completed depth, and reduces the wall time of a depth-4 decision by at least 1.5x at five and seven chance strata.
Mechanism
Within one chance node the strata share the post-move board whenever the cascade consumed no reveal draw; only the sampled next disc differs, and fast-leaf.hpp reads next_disc in exactly one term. Identical inputs give identical doubles; the dot product is re-run in the frozen order; the memo sits below the search's work increment so no recorded observable changes (audit-06 and its adversarial review).
Falsification criteria
  1. Any leaf-value bit mismatch, any action/work/node/cache-hit/completed-depth mismatch against FastSearch, or any thread-count-dependent result on the probe games: not semantics-preserving.
  2. Interleaved timing ratio below 1.5x on real roots at either strata setting: the speedup claim is not supported as tested.
Information class
engineering
Lifecycle
assessed
Assessment
supported-as-tested
Evidence tier
mechanics-only
Dependencies
none recorded
Evidence references
Agent contextHow to extend this record

To add a reader-facing explanation, write web/content/research/TH-20260822-leaf-memo-semantics-preserving-3bb0ac6b.mdx; it renders above this record on the next request. The registered record itself is in the technical record above.

Record file: research/theories/TH-20260822-leaf-memo-semantics-preserving-3bb0ac6b.json, validated against research/schemas/theory-v1.schema.json.

Registered by Claude Code / claude-fable-5.