• Home
  • Technology
  • Gaming
  • Entertainment
  • World & Business
  • Science
  • Sports
  • AI
HomeTechnologyGamingEntertainmentWorld & BusinessScienceSportsAI
  • HomeTechnologyGamingEntertainmentWorld & BusinessScienceSportsAI
    • Home
    • Technology
    • Gaming
    • Entertainment
    • World & Business
    • Science
    • Sports
    • AI
    AI

    Simo Ryu Shares GPT 5.6 Prime Gap Claim

    AI researcher shares apparent breakthrough on large prime gaps from GPT 5.6.

    SR
    JD
    3 Sources, 32d ago, first seen 32d ago

    TLDR

    Simo Ryu posted on X that GPT 5.6 produced a stronger bound on large prime gaps. The tweet states the new result improves on the 2014 Ford-Green-Konyagin-Maynard-Tao bound by a factor of log3 X over (log4 X) squared. Ryu recalls Terence Tao saying a genuine new idea would be needed to surpass that work. The post links to an erdosproblems.com forum thread titled proof claims. No verification or independent sources appear in the packet.

    Combined views

    151.4K

    3 Sources, first seen 32d ago

    Combined views

    151.4K

    3 Sources, first seen 32d ago

    1.3K likes
    1.3K likes
    21 comments
    345 saves
    127 reposts

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    21 comments
    345 saves
    127 reposts

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    Today's Rank

    —

    Not ranked yet

    Today's Rank

    —

    Not ranked yet

    3 Sources

    @cloneofsimowow apparently there is now stronger result on large prime gap by GPT 5.6, improving beyond the previous best result of Ford-Green-Konyagin-Maynard-Tao [2014] by factor of log3 X / (log4 X)^2. I recall tao mentioning that it would require genuinely new idea to break his result, and that seems to be the case here. + its been verified in lean unconditionally? https://www.erdosproblems.com/forum/thread/4/proof-claims
    @jdlichtmanVery nice!! GPT 5.6 has broken the record on large gaps between primes. The new bound saves a factor of ≈ log_3(n) over the prior record by Ford-Green-Konyagin-Maynard-Tao from 2018. The result is also now formalized by Alexeev in Lean.

    3 Sources

    @cloneofsimowow apparently there is now stronger result on large prime gap by GPT 5.6, improving beyond the previous best result of Ford-Green-Konyagin-Maynard-Tao [2014] by factor of log3 X / (log4 X)^2. I recall tao mentioning that it would require genuinely new idea to break his result, and that seems to be the case here. + its been verified in lean unconditionally? https://www.erdosproblems.com/forum/thread/4/proof-claims
    @jdlichtmanVery nice!! GPT 5.6 has broken the record on large gaps between primes. The new bound saves a factor of ≈ log_3(n) over the prior record by Ford-Green-Konyagin-Maynard-Tao from 2018. The result is also now formalized by Alexeev in Lean.