Open repo invites AI swarms to tighten the 4.6155n circuit lower-bound constant

rrwilliams · x · 2026-11-17

Alongside the STOC paper "Explicit functions requiring circuits larger than 4.5n" (McGuire, Schlesinger, Williams), rrwilliams open-sourced the circuit-lb-4.6155n repo: a complete proof that the cubic cutwidth constant is at most Mtree ≤ 0.2765836097, implying Li's function needs over (4.6155−ε)n gates, plus proof indexes and computer-verified finite claims. He invites people to send AI agent swarms to improve the constant and post progress, a crowdsourced human-AI theory experiment.

Related event: Researchers Call for Spare AI Compute to Improve Circuit Complexity Constants(2 posts)→

Original post →

More from Research

Research channel →