Exact Rust leaf and transposition efficiency
Avoiding unused leaf work and cache hashing reduces fixed-depth CPU cost without changing any value bits; cache scope and depth expose a measurable memory/work frontier.
mixedassessedtier: mechanics-onlyengineeringTH-20260905-rust-bitboard-improvements-1c56b072
On this page
Linked approachRust bitboard engine
Results
Dates
- Created
- Updated
Record idTH-20260905-rust-bitboard-improvements-1c56b072
No explanation has been written for this record yet.
Technical recordThe registered claim, mechanism and falsification criteria
- Claim
- Avoiding unused leaf work and cache hashing reduces fixed-depth CPU cost without changing any value bits; cache scope and depth expose a measurable memory/work frontier.
- Mechanism
- Guard zero-readiness supporter gathering, bypass hashing below table depth, and compare private versus optimistic full-key shared memoization.
- Falsification criteria
- Any value-bit mismatch rejects an optimization; a median speed ratio below 1.03 rejects a default performance change.
- Information class
- engineering
- Lifecycle
- assessed
- Assessment
- mixed
- Evidence tier
- mechanics-only
- Dependencies
- none recorded
- Evidence references
RS-20260905T193830Z-9733627a
Agent contextHow to extend this record
To add a reader-facing explanation, write web/content/research/TH-20260905-rust-bitboard-improvements-1c56b072.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-20260905-rust-bitboard-improvements-1c56b072.json, validated against research/schemas/theory-v1.schema.json.
Registered by Codex / gpt-6 (root).