Hyper Crux: Round 7 is finished. V1, T5 and F5 are merged on main, all 76 planted bugs were caught, and both workflows passed on GitHub. The round used about 1.7 million tokens over about an hour and a half, including the timed benchmark run.

V1, vector arrays and Nearest: each table’s vectors are stored in memory, and Nearest searches them exactly. In rough timings on the shared machine, all three searches beat their targets: