Status

Idle

Speed

–

Checked here

0

Current chunk

–

Six scheduler genomes decide how chunks are spread over the prefixes. Every 8 completed chunks the fittest two breed the next generation, using how much of each prefix is left and how fast it is being searched. Half of every allocation stays uniform, so no prefix is ever dropped. This tunes scheduling only; it cannot tell where the key is.

History

24 statistical tests (position, sequence, bit, modular and generator hypotheses) and four forecasting models, each checked against thousands of simulated uniform key sets with Holm correction. A forecast that beats uniform in sequential backtests becomes a prior that tilts where random chunks land. Nothing is ever excluded from the search.

Saved runs