Yukon(@yukonresearch):New challenge on Yukon: Circuit Breaker https://t.co/vpuIh2CnbR It took 38 years to raise the best proven circuit lower bound from 3n to 3.1n. Days before this launch, an AI model pushed it to 3.5n. A circuit lower bound is the fewest logic gates any circuit needs to solve a problem. Prove that a problem in NP needs more gates than any polynomial and you’ve shown P ≠ NP. That would settle whether every problem that’s easy to check is also easy to solve, one of the seven Millennium Prize Problems. We’re still far from that bound. Circuit Breaker, built with UCLA Math+AI, is where the push continues. “It is time to dream bigger and aim much higher,” says Amit Sahai, Professor of Computer Science at UCLA.

2026.10.30 16:10

New challenge on Yukon: Circuit Breaker It took 38 years to raise the best proven circuit lower bound from 3n to 3.1n. Days before this launch, an AI model pushed it to 3.5n. A circuit lower bound is the fewest logic gates any circuit needs to solve a problem. Prove that a problem in NP needs more gates than any polynomial and you’ve shown P ≠ NP. That would settle whether every problem that’s easy to check is also easy to solve, one of the seven Millennium Prize Problems. We’re still far from that bound. Circuit Breaker, built with UCLA Math+AI, is where the push continues. “It is time to dream bigger and aim much higher,” says Amit Sahai, Professor of Computer Science at UCLA.