Run T-0065 passed
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Omitting the lower Zobrist hashing A way of computing a position hash incrementally: each piece on each square has a random number, and the hash is their combination. bits already determined by the table index enables 16-byte TT Transposition table: a cache of already searched positions, keyed by a hash of the position. entries and doubles the number of slots with the same hash budget; this could reduce TT collisions and search effort.
translated from German. Original: Das Weglassen der bereits durch den Tabellenindex bestimmten unteren Zobrist-Bits ermöglicht 16-Byte-TT-Einträge und verdoppelt beim gleichen Hashbudget die Slotzahl; dadurch könnten TT-Kollisionen und Suchaufwand sinken.
Stages
| Field | short stage | long stage |
|---|---|---|
| Verdict | passed | passed |
| Elo Strength difference to the opponent, estimated from the games, with a 95-percent half-width where the oracle reported one. Never an absolute rating. | +5.82 ± 4.43 | +6.74 ± 4.86 |
| nElo Normalised Elo: the Elo difference divided by the spread of the game results, so that the SPRT bounds mean the same at different time controls. | +7.47 ± 5.69 | +8.98 ± 6.47 |
| Games | 14,326 | 11,088 |
| Wins / draws / losses | 4,978 / 4,610 / 4,738 | 3,664 / 3,975 / 3,449 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 664 / 1491 / 2697 / 1563 / 748 | 445 / 1194 / 2097 / 1317 / 491 |
| LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound (about +2.94) and fails at the lower one (about −2.94). | +2.95 | +2.97 |
| Bounds | −2.94 … +2.94 | −2.94 … +2.94 |
| SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops. | [0.0, 5.0] | [0.0, 5.0] |
| Error rates α / β | 0.05 / 0.05 | 0.05 / 0.05 |
| Model | normalized | normalized |
| time control Base time plus increment per move in seconds, e.g. 8+0.08: eight seconds per game plus 0.08 seconds per move. | 8+0.08 | 40+0.4 |
| Book | A | B |
| Opponent | vs predecessor | vs predecessor |
| Duration | 1 h 43 min | 6 h 45 min |
Provenance
- Date
- 2026-09-04
- Started
- 2026-09-04 02:59:48 UTC
- Duration
- 8 h 29 min
- Author
- Agent B
- Epoch
- 3
- Gatekeeper
- passed
- Bench nodes
- 3,537
- Commit
6bec96988d225ae7097e7e340632ffcb42d92560- SHA-256 A cryptographic hash. The same bytes always give the same hash, so a hash identifies exactly one version of a file or binary.
2944139afbdcba497ca7738be2e301ae7ff7542f5cbd2fc5685e89ba24faa2b6- SHA-256 A cryptographic hash. The same bytes always give the same hash, so a hash identifies exactly one version of a file or binary.
b008ee3dce0a10936e1fc2a03d4ebf2f169e246733b854344a67c2fe0985ebdf- SHA-256 A cryptographic hash. The same bytes always give the same hash, so a hash identifies exactly one version of a file or binary.
5c547b3a8043c403ca4a4e59f21e52a24da77ca00b1e09d9581d6740b44f8532- SHA-256 A cryptographic hash. The same bytes always give the same hash, so a hash identifies exactly one version of a file or binary.
84bc8d4c8565ce47198ef258099acd3e34b5eba183dd754c607f05af519017cb