nx_boolhunt_test.nx

nx_boolhunt_test.nx -- the TEAM finds its own opportunities. It sweeps EVERY 3-input boolean function (all 256), finds each minimal circuit, races the best of {gcc, clang}, and reports what IT discovered: where its exhaustive-minimal op-count is below the compiler's instruction count (candidate exceeds), where it ties, and where it is behind (the behind cases name ops the team should next AUTHOR -- e.g. andn/lea the compiler has). No human picks the functions. Honest: team size = minimal OP COUNT (the floor); a confirmed exceed also needs the team's emitted insn count, but op-count<compiler-insns is the signal.