Run T-0167 rejected
· Evidence: SPRT Sequential probability ratio test. Games are played until the accumulated evidence reaches one of two bounds; then the test stops.
Hypothesis
Updating int16 accumulators via a runtime-selected routine using 512-bit words (32 instead of 16 sums per step) on processors with AVX-512F and AVX-512BW yields bit-identical accumulators and an unchanged search tree. This increases the node rate on these processors and improves playing strength under time controls.
Wording edited for publication from the German entry; the register carries the author’s own text.
Stages
| Field | short stage |
|---|---|
| Verdict | rejected |
| 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. | +0.34 ± 1.45 |
| 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. | +0.78 ± 3.34 |
| Games | 41,692 |
| Wins / draws / losses | 10,070 / 21,593 / 10,029 |
| pentanomial Games are played in pairs with swapped colours; the five counts are the pairs scoring 0, ½, 1, 1½ and 2 points. | 89 / 3581 / 13474 / 3604 / 98 |
| LLR Log-likelihood ratio, the running evidence of an SPRT. It starts at 0; a stage passes at the upper bound and fails at the lower one. | −2.97 |
| Bounds | −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] |
| Error rates α / β | 0.05 / 0.05 |
| Model | 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 |
| Book | A |
| Opponent | vs predecessor |
| Duration | 5 h 12 min |
Provenance
- Date
- 2026-10-08
- Started
- 2026-10-08 13:05:13 UTC
- Duration
- 5 h 12 min
- Author
- Agent D
- Epoch
- 7
- Gatekeeper
- passed
- Bench nodes
- 851