CrocSwap/integer-mult-bounds
View on GitHub ↗ ★ 318 Python
Conditional integer multiplication: kappa > 2^-15. Community proofs, exact certificates and reproducible audits; assumes the OpenAI #109 framework.
7 mentions on Hacker News by 6 people: 3 stories, 4 comments · first 2026-10-08 · latest 2026-10-21
20082026
-
▲ 36
Κ = 0.003 for integer multiplication crossedstory by aleph_minus_one · 2026-10-21 · 22 comments
-
…dumping parallel research results including dead ends by ending the title with "(no new kappa)". https://github.com/CrocSwap/integer-mult-bounds/pulls
comment by samuelknight · 2026-10-13 · in Auto Research: Integer multiplication below n log n -
…underway to improve the bound. They have reached at a much larger kappa around 0.001635527380375392 https://github.com/CrocSwap/integer-mult-bounds
comment by itissid · 2026-10-13 · in A look at the math that OpenAI claims computes faster Fourier transforms -
…has massively improved the lower bound (from 1-2^-182 to about 1-2^-10) in the past couple of days: https://github.com/CrocSwap/integer-mult-bounds
comment by nialv7 · 2026-10-11 · in Terence Tao: Math 2.0 [pdf] -
▲ 1
Community pushed OpenAI FFT proof to over 10^-4story by mcmoor · 2026-10-09 · 0 comments
-
They just merged my PR for the current tightest bound on the integer multiplication problem: https://github.com/CrocSwap/integer-mult-bounds/pull/37#even... Something interesting happened last night: Researchers started proposing tighter…
comment by GPUboy · 2026-10-08 · in They just merged my PR for the bound on the integer multiplication problem -
▲ 3
They just merged my PR for the bound on the integer multiplication problemstory by GPUboy · 2026-10-08 · 1 comment