Pinned post
Fall CTF is well under way! We have badges out to attendees! Huge thanks for the @sigpwny team for finishing assembly and software! We're gonna shoot for badges again next year!
Sam Ruggerio
@Sam_Ruggerio
Current CS PhD student at UIUC. Interests in theory, security, graphics, and HPC
226 Following 209 Followers 744 Posts
Latest posts 5
Rmk 1.12.5 defines A but A is statement of RH, so you assume RH to solve RH.
The Clanks haven't solved it yet...
The Clanks haven't solved it yet...
Announcing a proof of the Riemann Hypothesis in Lean 4.View quoted post on X
philpapers.org/rec/NIEPOT-5
@AltRealityGameX
@ClayInstitute
github.com/startigerjln/N…
We beat @OpenAI and @Anthropic
Openai math repo proved SETH is false...
Today I am publishing a draft computing the DFT in n (log n) ^ (1 - delta) where delta = -2.28 * 10^-3
This is a 300-million fold regression. I just think we needed to do Fourier transforms a bit slower.
This is a 300-million fold regression. I just think we needed to do Fourier transforms a bit slower.
We’re publishing a research draft on OpenAI Problem #130: computing the exact discrete Fourier transform below n log n.View quoted post on X
Our draft proposes an all-length bound of
T(n) = O(n(log n)^(1−δ)), with δ = 7.3×10⁻⁵.
That’s a 730-million-fold increase in the exponent saving over OpenAI’s published δ = 10⁻¹³.
Building on Swapnil Jain’s round-six complex network for Problem #109 and its cited predecessors, we propose transferring those advances from integer multiplication to the Fourier setting.
