fine-grained-complexity

Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks

Deterministic 3SUM in O(n^1.995782) and APSP / (min,+) / all-edges Exact Triangle in O(n^2.995943), improving Alman–Vassilevska Williams: proofs, certificates, Lean 4 checks, and a list of closed ideas to avoid duplicate work

Living, open dataset: which results conditional on ETH/SETH/Gap-ETH/#ETH (and 3SUM/APSP) are refuted, rescuable or unsupported after the reported 2026 refutations

Deterministic Subset Sum faster than meet-in-the-middle: 2^{0.4986298 n}, derandomising Ye–Li and OpenAI's 2^{0.49n} construction. Proofs, interval certificates, Lean 4 checks, and closed ideas. Preprint, not peer reviewed.

C++20 implementation (standard library only) of the deterministic truly subquadratic 3SUM algorithm of Alman & Vassilevska Williams (arXiv:2610.06783)

The Exponential Time Hypothesis (ETH) is False — October 25, 2026.

Attention Is More Than You Need (NeurIPS 2026): spectral redundancy in multi-head routing - research artifact