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.
More from Research
- Must-read papers of the week: robot manipulation, agent memory, long-horizon evals — TheTuringPost · 2026-11-17
- Llama 3 8B with heavy sampling beats single-shot GPT-4o on competitive programming and formal math — agihouse_org · 2026-11-17
- Professor rants: peer review took a year amid "AI slop" reviews — preprint would've beaten it — RexDouglass · 2026-11-17
- UCLA and AWS paper: AI agents find math shortcuts but thinking time often cancels the gains — rohanpaul_ai · 2026-11-17
- Scientific writing LLM trained to defeat detectors: Pangram 4.1 flags it as human — alejandroll10 · 2026-11-17
- ICLR 2027 debate: researchers plead with reviewers to at least acknowledge rebuttals — IanArawjo · 2026-11-17