Tap a claim on the ring to put it at the centre.
← Some theorems may only ever be provable by unintelligible case-by-case…
17 connected korrents · 8 moments on record from 14 Jun 2025 to 21 Aug 2026.
Everything filed under cryptography
cryptography
Everything filed under mathematics
mathematics
Everything filed under AI and science
AI and science
Everything filed under formal proof
formal proof Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Same subject Read this korrent: Some theorems may only ever be provable by unintelligible case-by-case brute force; the four colour theorem still has no conceptually elegant proof. Some theorems may only ever be provable by unintelligible case-by-case brute force; the four colour theorem still has no conceptually elegant proof. Last stated 6 months ago
20 Mar 2026
TT
Terence Tao — holds since 2026-03-20 — tap for who they are
Same subject: A proof and an explanation are different things, and a theorem can stay an unsolved expository problem long after it is proved. — tap to centre the map on it A proof and an explanation are different things, and a theorem can stay an unsolved expository problem long after it is proved. Last stated 2 months ago
30 Jun 2026
GS
Grant Sanderson — holds since 2026-06-30 — tap for who they are
Same subject: Struggling with a hard problem before being shown the answer is not always the best way to learn; a hint or a worked example can beat floundering. — tap to centre the map on it Struggling with a hard problem before being shown the answer is not always the best way to learn; a hint or a worked example can beat floundering. Last stated 2 months ago
22 Jul 2026
SY
Scott H. Young — no longer holds since 2026-07-22 — tap for who they are
Same subject: On P versus NP, the evidence leans towards no, and the problem is unusual in how many approaches have been proven not to work. — tap to centre the map on it On P versus NP, the evidence leans towards no, and the problem is unusual in how many approaches have been proven not to work. Last stated a year ago
14 Jun 2025
TT
Terence Tao — holds since 2025-06-14 — tap for who they are
Same subject: The fear that a great theorem will arrive as an incomprehensible proof is misplaced, because once the proof exists as an artifact we can analyse it. — tap to centre the map on it The fear that a great theorem will arrive as an incomprehensible proof is misplaced, because once the proof exists as an artifact we can analyse it. Last stated 6 months ago
20 Mar 2026
TT
Terence Tao — holds since 2026-03-20 — tap for who they are
Same subject: The twin prime conjecture is certainly true, the random model gives overwhelming odds of it, and he just cannot prove it. — tap to centre the map on it The twin prime conjecture is certainly true, the random model gives overwhelming odds of it, and he just cannot prove it. Last stated a year ago
14 Jun 2025
TT
Terence Tao — holds since 2025-06-14 — tap for who they are
Same subject: What AI still cannot do in mathematics is build cumulatively on partial progress; it is trial, error and brute force rather than an idea improving through use. — tap to centre the map on it What AI still cannot do in mathematics is build cumulatively on partial progress; it is trial, error and brute force rather than an idea improving through use. Last stated 6 months ago
20 Mar 2026
TT
Terence Tao — holds since 2026-03-20 — tap for who they are
Same subject: The hardest part of solving a mathematical problem is the part AI has not touched; he still does it with pen and paper. — tap to centre the map on it The hardest part of solving a mathematical problem is the part AI has not touched; he still does it with pen and paper. Last stated 6 months ago
20 Mar 2026
TT
Terence Tao — holds since 2026-03-20 — tap for who they are
Same subject: If the Riemann hypothesis turned out to be false, prime-based cryptography would be abandoned very quickly, because one unknown pattern implies more. — tap to centre the map on it If the Riemann hypothesis turned out to be false, prime-based cryptography would be abandoned very quickly, because one unknown pattern implies more. Last stated 6 months ago
20 Mar 2026
TT
Terence Tao — holds since 2026-03-20 — tap for who they are
Same subject: A sufficiently large random reversible circuit is plausibly a secure cryptographic permutation, while a large random irreversible circuit collapses to only a few possible outputs. — tap to centre the map on it A sufficiently large random reversible circuit is plausibly a secure cryptographic permutation, while a large random irreversible circuit collapses to only a few possible outputs. Last stated 3 weeks ago
21 Aug 2026
VB
Vitalik Buterin — holds since 2026-08-21 — tap for who they are
Same subject: As of 2026, local mixing has not yet sufficiently eliminated correlations between original circuit values and their obfuscated counterparts. — tap to centre the map on it As of 2026, local mixing has not yet sufficiently eliminated correlations between original circuit values and their obfuscated counterparts. Last stated 3 weeks ago
21 Aug 2026
VB
Vitalik Buterin — holds since 2026-08-21 — tap for who they are
Same subject: Building a secure obfuscation protocol is extremely difficult. — tap to centre the map on it Building a secure obfuscation protocol is extremely difficult. Last stated 2 months ago
29 Jun 2026
VB
Vitalik Buterin — holds since 2026-06-29 — tap for who they are
Same subject: AI will transform how scientific discovery is done, and within two or three years a working scientist's job will already look dramatically different. — tap to centre the map on it AI will transform how scientific discovery is done, and within two or three years a working scientist's job will already look dramatically different. Last stated 3 weeks ago
18 Aug 2026
MK
Michael Kratsios — holds since 2026-08-18 — tap for who they are
Same subject: Autonomous cloud labs that run the whole loop — hypothesis, experiment, result, next hypothesis — without human intervention are within reach. — tap to centre the map on it Autonomous cloud labs that run the whole loop — hypothesis, experiment, result, next hypothesis — without human intervention are within reach. Last stated 3 weeks ago
18 Aug 2026
MK
Michael Kratsios — holds since 2026-08-18 — tap for who they are
Same subject: Current AI struggles even to rediscover old laws of physics from data, and when it does, contamination from training is the first suspect. — tap to centre the map on it Current AI struggles even to rediscover old laws of physics from data, and when it does, contamination from training is the first suspect. Last stated a year ago
14 Jun 2025
TT
Terence Tao — holds since 2025-06-14 — tap for who they are
Same subject: AI-written code makes formal proof necessary, because human review of all that generated code becomes the bottleneck. — tap to centre the map on it AI-written code makes formal proof necessary, because human review of all that generated code becomes the bottleneck. Last stated 5 months ago
22 Apr 2026
MK
Martin Kleppmann — holds since 2026-04-22 — tap for who they are
Same subject: Formal verification is about to become economical, because models are getting good enough at writing the proofs that humans no longer have to. — tap to centre the map on it Formal verification is about to become economical, because models are getting good enough at writing the proofs that humans no longer have to. Last stated 5 months ago
22 Apr 2026
MK
Martin Kleppmann — holds since 2026-04-22 — tap for who they are
Same subject: Formalising a proof in Lean currently takes about ten times the effort of writing it out: doable, but annoying. — tap to centre the map on it Formalising a proof in Lean currently takes about ten times the effort of writing it out: doable, but annoying. Last stated a year ago
14 Jun 2025
TT
Terence Tao — holds since 2025-06-14 — tap for who they are
At the centre
Some theorems may only ever be provable by unintelligible case-by-case brute force; the four colour theorem still has no conceptually elegant proof.
Holds TT Terence TaoRead this korrent →
A proof and an explanation are different things, and a theorem can stay an unsolved expository problem long after it is proved.
Holds GS Grant Sanderson
Struggling with a hard problem before being shown the answer is not always the best way to learn; a hint or a worked example can beat floundering.
No longer holds SY Scott H. Young
On P versus NP, the evidence leans towards no, and the problem is unusual in how many approaches have been proven not to work.
Holds TT Terence Tao
The fear that a great theorem will arrive as an incomprehensible proof is misplaced, because once the proof exists as an artifact we can analyse it.
Holds TT Terence Tao
The twin prime conjecture is certainly true, the random model gives overwhelming odds of it, and he just cannot prove it.
Holds TT Terence Tao
What AI still cannot do in mathematics is build cumulatively on partial progress; it is trial, error and brute force rather than an idea improving through use.
Holds TT Terence Tao
The hardest part of solving a mathematical problem is the part AI has not touched; he still does it with pen and paper.
Holds TT Terence Tao
If the Riemann hypothesis turned out to be false, prime-based cryptography would be abandoned very quickly, because one unknown pattern implies more.
Holds TT Terence Tao
A sufficiently large random reversible circuit is plausibly a secure cryptographic permutation, while a large random irreversible circuit collapses to only a few possible outputs.
Holds VB Vitalik Buterin
As of 2026, local mixing has not yet sufficiently eliminated correlations between original circuit values and their obfuscated counterparts.
Holds VB Vitalik Buterin
Building a secure obfuscation protocol is extremely difficult.
Holds VB Vitalik Buterin
AI will transform how scientific discovery is done, and within two or three years a working scientist's job will already look dramatically different.
Holds MK Michael Kratsios
Autonomous cloud labs that run the whole loop — hypothesis, experiment, result, next hypothesis — without human intervention are within reach.
Holds MK Michael Kratsios
Current AI struggles even to rediscover old laws of physics from data, and when it does, contamination from training is the first suspect.
Holds TT Terence Tao
AI-written code makes formal proof necessary, because human review of all that generated code becomes the bottleneck.
Holds MK Martin Kleppmann
Formal verification is about to become economical, because models are getting good enough at writing the proofs that humans no longer have to.
Holds MK Martin Kleppmann
Formalising a proof in Lean currently takes about ten times the effort of writing it out: doable, but annoying.
Holds TT Terence Tao