Both sides are right. Math must adapt in the AI era. But it also must preserve the standards of stewardship, mentorship and communication that have made mathematics humankind's premier intellectual undertaking. Today, we are announcing hodge.computer, the first open autoresearch initiative targeting a special case of the generalized Hodge conjecture. We believe that mathematics will increasingly be conducted in massively multiplayer, digitally coordinated research programs, with each individual contribution verified by Lean, and progress collected in a central, public leaderboard. At the same time, each such project needs a human mathematician who has pledged to accept responsibility for the cultivation and crystallization of all knowledge that ensues from the project, as well as the identification and crediting of all relevant prior work. Early predecessors of this model can be found at least as far back as the Polymath projects of Gowers, Tao and their collaborators. More recently, erdosproblems.com has resoundingly demonstrated the viability of this research model. The problem is that much of math—and Hodge theory perhaps most of all—is hard to formalize, and hard to make incremental progress on. Thus, in the AI era, the most important task for a mathematician may well shift from > can you solve this problem? to > can you reëxpress this problem in an equivalent form, which in turn is computationally effective? The latter being done, we can subject the problem at hand to a massive open autoresearch program. hodge.computer targets the GHC for the involution-invariant Hodge structure H ⊂ H⁴(X, ℚ), where X ⊂ ℙ⁵ is a smooth sextic hypersurface preserved by the involution on ℙ⁵ that changes the signs of three homogeneous coordinates. This important GHC subcase has been isolated and championed by Voisin. Recent work of Diamond has translated the prediction at issue into a computationally explicit form. We launch with 42 verified certificates and 19 open targets. Now, everyone can contribute to the most fascinating problem in all of algebraic geometry. Visit hodge.computer for background and contribution instructions; feel free also to join our Discord.

It’s a wrap! It was an honor to help organize the Fast Finality workshop in Cambridge. There have already been some great recaps, but here’s my quick overview of the main topics we covered: 1. Deep-diving DC: Decoupled Consensus is a super ambitious upgrade we hope to ship in I* (h/t @benjaminion_xyz). @robsaltini gave a great overview, and @fradamt unveiled his impressive recent breakthroughs, e.g. achieving short-term async resilience through local locks. 2. Shipping DC: Sessions on critical research and engineering, including networking benchmarks & devnets (@sukunrt & Csaba), rewards & incentives (@weboftrees), and specs & testing (@mkalinin2, @jtraglia, @tcoratger). 3. Securing DC: Formal verification meets fast finality. We explored exciting new AI-enabled opportunities (@fradamt & @robsaltini), building on years of great FV work (@alexanderlhicks). 4. Future of Fast Finality: Aligning DC with future needs. This covered PQ networking (@kamil_abiy & @kevaundray), finality in tens of seconds with PQ validators (@barnabemonnot), lean clients & prototyping (@pablodeymo, Mega, Mihir, Locky, @adust09, @ladislaus0x), and one-round finality & other future research (shoutout @alranpe, @jneu_net, @ittai & Neil). Huge thanks to everyone who made this workshop a success! Special thanks to @benjaminion_xyz for all the help and guidance, and of course to @justindrake and @willcorcoran for making it possible!

Glad to spend time with talent from around the world thinking through the unsolved problems My love for Ethereum just got deeper Goodbye, Cambridge

ケンブリッジは後半戦へ 休む暇がないぜ