Shiva Kintali

AI Architect at Nvidia, Mathematician, Cryptographer, Ex Princeton Lecturer, Artist, Writer, GeorgiaTech (PhD), USC (MS), IIT Kharagpur (B-Tech)


Some mathematician has said pleasure lies not in discovering truth, but in seeking it.


Recent papers (Mathematics, Physics, Quantum Computing, Graph Theory, Theoretical Computer Science)

  1. A simplified proof of ETH is false. [pdf]
  2.     Preprint

  3. Breaking the 1/2 Barrier for Well-Supported Nash Equilibria in Win–Lose Games. [pdf]
  4.     Preprint

  5. Parity is not in QAC0 (via Polarization and Direct Induction). [pdf]
  6.     Preprint

  7. A Short Proof of the Quasi-Riemann Hypothesis. [pdf]
  8.     Preprint

  9. An Optimal Quantum Query Lower Bound for Matrix-Product Verification. [pdf]
  10.     Preprint

  11. Quantum Triangle Finding via Triangle-Free Templates and Density-Sensitive Search. [pdf]
  12.     Preprint

  13. Quantum Graph Collision: An Upper Bound Below n^{2/3}. [pdf]
  14.     Preprint

  15. On the Fixed-Order Strong Komlós Conjecture. [pdf] [ECCC]
  16.     Preprint

  17. The Optimal 1/e Guarantee for Rank-Two Matroid Secretary. [pdf]
  18.     Preprint

  19. Beyond 7/5 for Graphic TSP on Bipartite Graphs. [pdf]
  20.     Preprint

  21. Breaking the 7/5 Barrier for Graphic TSP on Graphs of Girth at Least Five [pdf]
  22.     Preprint

  23. Linear Advice for Randomized Auxiliary Pushdown Computation. [pdf]
  24.     Preprint

  25. Harmonic and Effective Lower Bounds for Sunflower-Free Families. [pdf]
  26.     Preprint

  27. Parity in Shallow QAC Circuits: Correlation Decay and Exact Lower Bounds. [pdf]
  28.     Preprint

  29. Exact Shallow Quantum Computation with Copies of the Input. [pdf]
  30.     Preprint

  31. Counting from Quantum Subset States: Sharp Copy Thresholds and Critical Profiles. [pdf]
  32.     Preprint

  33. Entropy-Charged Soft Spectral Decompositions with Applications to Unique Games. [pdf]
  34.     Preprint

  35. Distinct zeros of fixed Dedekind zeta functions. [pdf]
  36.     Preprint

  37. Improved Bounded Gaps Between Primes. H1 <= 236. [pdf]
  38.     Preprint
        Aug 31, 2026: Julia Stadlmann proved H1 <= 240 using novel ideas, without using AI. This is the first improvement from 246 in more than a decade.
        Sep 1, 2026: Building upon Julia Stadlmann's ideas, I proved H1 <= 236 using AI.
        Sep 3, 2026: Axiommath announced H1 <= 212 using AI.
        Sep 3, 2026: OpenAI announced H1 <= 186 using AI.

  39. Many Large Least Primes in Arithmetic Progressions from Short Translates. [pdf]
  40.     Preprint

  41. Irrationality of the 5-adic zeta value zeta_5(3). [pdf]
  42.     Submitted to a Journal

  43. A cubic lower bound for electrostatic equilibria: Failure of the real-charge Morse Maxwell bound. [pdf]
  44.     Submitted to a Journal

  45. A Quadratic Lower Bound for Maxwell's Equilibrium Problem. [pdf]
  46.     Submitted to a Journal

  47. More than 42.1% of the Zeros of the Riemann Zeta Function Are on the Critical Line. [pdf]
  48.     Preprint
        Aug 8, 2026: I achieved 42.1%
        Aug 10, 2026: Anthropic announced 67.2%

  49. A Superlinear Lower Bound for Maxwell's Equilibrium Problem. M(n) = Omega(n^{3/2}). [pdf]
  50.     Submitted to a Journal

  51. A Sharp Maxwell Bound for Three Point Charges. M(3) = 4. [pdf]
  52.     Submitted to a Journal

  53. Lower Bounds for the Maxwell Equilibrium Function for Four, Six, Eight, Nine, and Ten Charges. [pdf]
  54.     Submitted to a Journal

  55. Three-Bit Flows and Cycle Covers. Part I (CDC Conjecture is True). [arXiv]
  56.     Preprint

  57. An Alternate Proof of Parity-L-Hardness of Graph Isomorphism. [pdf]
  58.     Preprint

  59. On the Harboth Conjecture. Part I. Quadrilaterals. [arXiv]
  60.     Preprint



Cryptics book is now available on Amazon in USA, India, UK, DE, FR, ES, IT, NL, PL, SE, BE, IE, JP, CA, AU
About Me

Shiva Kintali is an AI Architect at Nvidia, Mathematician, Cryptographer, Ex Princeton Lecturer, Artist, Writer.

He is a frequent public speaker on AI, Blockchain, Cryptography and Game theory and their socio-economic and cultural impact.

His (academic and industry, theoretical and practical) experience spans algorithm design, complexity theory, cryptography, machine learning, blockchain protocols, algorithmic game theory, structural graph theory, group theory, mathematical physics, elliptic curves, natural language processing, information retrieval, compiler design and high-performance computing.

He received his PhD in Computer Science from Georgia Institute of Technology, Masters in Computer Science from University of Southern California and B-Tech in Computer Science and Engineering from Indian Institute of Technology, Kharagpur.

He is the recipient of Young Alumni Achiever Award from his alma mater, Indian Institute of Technology (IIT) Kharagpur. IIT bestows the award on alumni under 45 who “have made a significant professional contribution which is recognized widely.”

He is the author of Cryptics, a hard science fiction novel and a technological thriller aimed at introducing some of the most amazing concepts of cryptography, blockchain, zero-knowledge proofs, artificial intelligence and mathematics in a fun, exciting and a memorable way. It is a story of five middle school students, who meet at a talk given by Dr. Shiva Kintali, a billionaire mathematician and a technologist. Doc brings their attention to a puzzle, whose solution is worth $10 Billion. The students compete with some of the best cryptographers, cypherpunks, mathematicians, coders and hackers of this generation. In the largest global treasure hunt ever. In the history of humankind.



Selected Publications in Game Theory, Complexity Theory, Routing Protocols
  1. Shiva Kintali,  Laura J. Poplawski,  Rajmohan Rajaraman,  Ravi Sundaram,  Shang-Hua Teng
    Reducibility Among Fractional Stability Problems    [full version pdf, FOCS version, SICOMP Journal Version ]
    Journal version is published in SIAM Journal on Computing. 2013, 42(6), pages 2063–2113
    In Proceedings of 50th FOCS. 2009. Atlanta, Georgia.
    Keywords: Game Theory, Nash Equilibrium, Fixed Points, Routing Protocols.

  2. Shiva Kintali.
    SCARF is PPAD-complete    [pdf]
    Manuscript
    Keywords: Game Theory, Nash Equilibrium, Fixed Points, Routing Protocols.

  3. Shiva Kintali.
    A Distributed Protocol for Fractional Stable Paths Problem    [pdf]
    In Proceedings of the DIMACS/DyDAn Workshop on Secure Internet Routing, Rutgers University, March 24-26, 2008
    Georgia Tech, College of Computing Technical Report GT-CS-08-06
    Keywords: Game Theory, Nash Equilibrium, Fixed Points, Routing Protocols.

  4. Shiva Kintali.
    Realizable Paths and the NL vs L Problem    [pdf]
    Preprint
    Keywords: Complexity Theory, Space Complexity.

Cryptocurrency public keys

  • Bitcoin address (QR Code): 1Jf5EeMmwG4M1XhFwCEEoXsQ2eNqLEshLg

  • News

  • Blockchain technology can curb certificate frauds: expert
  • Blockchain is imperative to rid sectors of fraud: Experts
  • A.I. Is Awesome, Blockchain Is a Powerhouse. But Here's What Combining Them Could Do
  • TrueShelf is one of The Top 10 Artificial Intelligence Companies Disrupting Education
  • The Future Is Adaptive: An Interview with TrueShelf’s Shiva Kintali
  • Harvard Battles Princeton In Nerdiness With Tweet That'll Totally Go Over Your Head
  • @Princeton Tweets

  • Book Reviews

  • Elements of Automata Theory
  • Boosting : Foundations and Algorithms
  • Algorithms Unplugged, The Power of Algorithms
  • Matching Theory