<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>Gradient Damage</title><subtitle>Maths you can see. Equations you can hear.</subtitle><link href="https://gradientdamage.com/"/><link rel="self" href="https://gradientdamage.com/feed.xml"/><id>https://gradientdamage.com/</id><updated>2026-10-13T06:00:00+00:00</updated>
<entry><title>Goldfeld&#x27;s Conjecture: Half Rank 0, Half Rank 1</title><link href="https://gradientdamage.com/videos/goldfelds-conjecture-half-rank-0-half-rank-1/"/><id>https://gradientdamage.com/videos/goldfelds-conjecture-half-rank-0-half-rank-1/</id><updated>2026-10-13T06:00:00+00:00</updated><summary>Goldfeld&#x27;s conjecture says that if you take one elliptic curve and twist it by every squarefree number d, half of the twists have analytic rank 0, half have analytic rank 1, and the average rank tends to 1/2. OpenAI claims a proof for the quadratic twists of every elliptic curve over the rationals…</summary></entry>
<entry><title>Restricted Geometric Langlands: OpenAI Claims Characteristic p</title><link href="https://gradientdamage.com/videos/restricted-geometric-langlands-openai-claims-characteristic-p/"/><id>https://gradientdamage.com/videos/restricted-geometric-langlands-openai-claims-characteristic-p/</id><updated>2026-10-13T00:10:00+00:00</updated><summary>The geometric Langlands program predicts a deep match between automorphic objects on a curve and Galois-side data; in characteristic p its &quot;restricted&quot; form was conjectured by Gaitsgory and Raskin. OpenAI claims a proof of that restricted equivalence for connected reductive groups on smooth…</summary></entry>
<entry><title>Prime Factors of p−1: OpenAI Claims the Poisson–Dirichlet Law</title><link href="https://gradientdamage.com/videos/prime-factors-of-p1-openai-claims-the-poisson-dirichlet-law/"/><id>https://gradientdamage.com/videos/prime-factors-of-p1-openai-claims-the-poisson-dirichlet-law/</id><updated>2026-10-12T23:50:00+00:00</updated><summary>Take a random prime p, factor p−1, and measure each prime factor q by log q / log(p−1): the pieces always add up to 1. Ford, Konyagin and Luca conjectured that these pieces follow the Poisson–Dirichlet law PD(1), the same random stick-breaking that describes the prime factors of a typical integer…</summary></entry>
<entry><title>Milne&#x27;s Rationality Conjecture: OpenAI Claims a Proof</title><link href="https://gradientdamage.com/videos/milnes-rationality-conjecture-openai-claims-a-proof/"/><id>https://gradientdamage.com/videos/milnes-rationality-conjecture-openai-claims-a-proof/</id><updated>2026-10-12T23:30:00+00:00</updated><summary>Milne&#x27;s rationality conjecture says that when an abelian variety is reduced mod p, pairing a Hodge class with products of divisors gives one and the same rational number in every cohomology theory. The animation shows the classical case with divisors: on the curve y² = x³ + 2, the 9 points with…</summary></entry>
<entry><title>Erdős–Gallai Conjecture: Every Graph Splits Into Few Loops</title><link href="https://gradientdamage.com/videos/erdos-gallai-conjecture-every-graph-splits-into-few-loops/"/><id>https://gradientdamage.com/videos/erdos-gallai-conjecture-every-graph-splits-into-few-loops/</id><updated>2026-10-12T23:10:00+00:00</updated><summary>The Erdős–Gallai cycle-decomposition conjecture asks whether the links of every graph on n dots can be split into at most C·n pieces, each a simple cycle or a single link, for one fixed constant C, even when the graph is dense and has about n² links. OpenAI claims a proof that such a constant…</summary></entry>
<entry><title>Hypercube Ramsey Conjecture: How Many Dots Force a Cube?</title><link href="https://gradientdamage.com/videos/hypercube-ramsey-conjecture-how-many-dots-force-a-cube/"/><id>https://gradientdamage.com/videos/hypercube-ramsey-conjecture-how-many-dots-force-a-cube/</id><updated>2026-10-12T22:50:00+00:00</updated><summary>Colour every link between N dots gold or cyan: how large must N be before a one-colour copy of the n-dimensional cube is guaranteed? Burr and Erdős asked in 1975 whether this Ramsey number grows only linearly in the cube&#x27;s 2^n corners, while the best bounds before stayed near (2^n)^2. OpenAI…</summary></entry>
<entry><title>Erdős Conjecture on Arithmetic Progressions: OpenAI Claims a Proof</title><link href="https://gradientdamage.com/videos/erdos-conjecture-on-arithmetic-progressions-openai-claims-a-proof/"/><id>https://gradientdamage.com/videos/erdos-conjecture-on-arithmetic-progressions-openai-claims-a-proof/</id><updated>2026-10-12T22:30:00+00:00</updated><summary>Erdős conjectured that any set of whole numbers whose reciprocals add up to infinity, like the primes, must contain equally spaced runs (arithmetic progressions) of every finite length. OpenAI claims a proof, with a quantitative Szemerédi-type bound: for each fixed k ≥ 3, a subset of {1, ..., N}…</summary></entry>
<entry><title>Gotsman–Linial Conjecture: OpenAI Claims Sensitivity ≤ 8d√n</title><link href="https://gradientdamage.com/videos/gotsman-linial-conjecture-openai-claims-sensitivity-8dn/"/><id>https://gradientdamage.com/videos/gotsman-linial-conjecture-openai-claims-sensitivity-8dn/</id><updated>2026-10-12T22:10:00+00:00</updated><summary>Cut the n-dimensional Boolean cube with the sign of a degree-d polynomial: how many of the n one-bit flips change the answer, on average? Gotsman and Linial conjectured in 1994 that low-degree polynomial threshold functions can only be sensitive to about d√n bits, far fewer than parity&#x27;s n. OpenAI…</summary></entry>
<entry><title>Erdős Similarity Conjecture: OpenAI Claims the Geometric Case</title><link href="https://gradientdamage.com/videos/erdos-similarity-conjecture-openai-claims-the-geometric-case/"/><id>https://gradientdamage.com/videos/erdos-similarity-conjecture-openai-claims-the-geometric-case/</id><updated>2026-10-12T21:50:00+00:00</updated><summary>Erdős asked whether every infinite set of reals can be dodged by some set of positive measure: a set containing no shrunk, shifted or flipped copy of the pattern. For geometric sequences 1, q, q², … OpenAI claims a proof: for every ratio q between 0 and 1 there is a compact set filling as much of…</summary></entry>
<entry><title>Hilbert-Smith Conjecture: OpenAI Claims a Proof in Every Dimension</title><link href="https://gradientdamage.com/videos/hilbert-smith-conjecture-openai-claims-a-proof-in-every-dimension/"/><id>https://gradientdamage.com/videos/hilbert-smith-conjecture-openai-claims-a-proof-in-every-dimension/</id><updated>2026-10-12T21:30:00+00:00</updated><summary>Hilbert&#x27;s fifth problem asked which groups can act continuously on a space. Gleason, Montgomery and Zippin showed that the answer is Lie groups, like rotations. One gap remained: could a strange group like the p-adic integers act faithfully on a manifold? That gap is the Hilbert–Smith conjecture…</summary></entry>
<entry><title>Ramsey Numbers r(s,t): OpenAI Claims the Sharp Log Exponent</title><link href="https://gradientdamage.com/videos/ramsey-numbers-r-s-t-openai-claims-the-sharp-log-exponent/"/><id>https://gradientdamage.com/videos/ramsey-numbers-r-s-t-openai-claims-the-sharp-log-exponent/</id><updated>2026-10-12T21:10:00+00:00</updated><summary>The Ramsey number r(s,t) is the fewest dots that force either s mutual friends or t mutual strangers, however the links are drawn. Since 1980 it has been known that r(s,t) grows at most like t^(s-1)/(log t)^(s-2), but the best lower bounds sat far below. OpenAI claims that for every fixed s ≥ 5…</summary></entry>
<entry><title>Kakeya Conjecture in 3D and 4D: OpenAI Claims a Proof</title><link href="https://gradientdamage.com/videos/kakeya-conjecture-in-3d-and-4d-openai-claims-a-proof/"/><id>https://gradientdamage.com/videos/kakeya-conjecture-in-3d-and-4d-openai-claims-a-proof/</id><updated>2026-10-12T20:50:00+00:00</updated><summary>A Kakeya set contains a unit needle pointing in every direction. Besicovitch showed such a set can have zero volume, and the Kakeya conjecture says it is still full-dimensional; in 3D the dimension statement was proved in 2025. OpenAI claims proofs that every four-dimensional Kakeya set has…</summary></entry>
<entry><title>Hilbert&#x27;s Tenth Problem Over the Rationals: OpenAI Says It&#x27;s Unsolvable</title><link href="https://gradientdamage.com/videos/hilberts-tenth-problem-over-the-rationals-openai-says-its-unsolvable/"/><id>https://gradientdamage.com/videos/hilberts-tenth-problem-over-the-rationals-openai-says-its-unsolvable/</id><updated>2026-10-12T20:30:00+00:00</updated><summary>Hilbert&#x27;s tenth problem asks for one procedure that decides whether any polynomial equation with integer coefficients has a solution; for whole-number solutions Matiyasevich (building on Davis, Putnam and Robinson) showed in 1970 that no such algorithm exists, but for fraction (rational) solutions…</summary></entry>
<entry><title>Birch and Swinnerton-Dyer Conjecture (BSD): OpenAI Claims Full Formula, Rank 0 and 1</title><link href="https://gradientdamage.com/videos/birch-and-swinnerton-dyer-conjecture-bsd-openai-claims-full-formula/"/><id>https://gradientdamage.com/videos/birch-and-swinnerton-dyer-conjecture-bsd-openai-claims-full-formula/</id><updated>2026-10-12T19:54:56+00:00</updated><summary>The Birch and Swinnerton-Dyer conjecture (BSD conjecture), one of the Millennium Prize problems, says the number of rational points on an elliptic curve is controlled by its L-function: y² = x³ − x + 1 has infinitely many (rank 1), while y² = x³ − x has only four (rank 0). OpenAI claims a proof of…</summary></entry>
<entry><title>Quantum Factoring: How Often Does Shor&#x27;s Algorithm Win?</title><link href="https://gradientdamage.com/videos/quantum-factoring-how-often-does-shors-algorithm-win/"/><id>https://gradientdamage.com/videos/quantum-factoring-how-often-does-shors-algorithm-win/</id><updated>2026-10-12T14:00:00+00:00</updated><summary>Multiplying two primes is easy. Undoing it is hard. Can a quantum computer factor any number, every single time? Hop by powers of 7 around a 15-hour clock and the pattern loops every 4 steps. That loop length cracks 15 into 3 × 5. For 2021 = 43 × 47 the loop in the animation is 322 steps, and for…</summary></entry>
<entry><title>Triangle Billiards: Will the Ball Hit Every Spot?</title><link href="https://gradientdamage.com/videos/triangle-billiards-will-the-ball-hit-every-spot/"/><id>https://gradientdamage.com/videos/triangle-billiards-will-the-ball-hit-every-spot/</id><updated>2026-10-12T11:00:03+00:00</updated><summary>Shoot a ball inside a triangle where one angle is an irrational multiple of π. Does it eventually visit every spot, in every direction, evenly? That is ergodicity of the billiard flow. In 1986 Kerckhoff, Masur and Smillie proved it for a dense set of special triangles, but never for all of them…</summary></entry>
<entry><title>The Harary–Hill conjecture: why 18 dots need 1,008 crossings</title><link href="https://gradientdamage.com/openai-math/harary-hill-conjecture/"/><id>https://gradientdamage.com/openai-math/harary-hill-conjecture/</id><updated>2026-10-12T09:00:00+00:00</updated><summary>The Harary–Hill conjecture gives the fewest crossings when every dot is joined to every other. OpenAI reports a proof for every n. What it says, and what is still unchecked.</summary></entry>
<entry><title>Barnette&#x27;s Conjecture: Does This Loop Always Exist?</title><link href="https://gradientdamage.com/videos/barnettes-conjecture-does-this-loop-always-exist/"/><id>https://gradientdamage.com/videos/barnettes-conjecture-does-this-loop-always-exist/</id><updated>2026-10-12T08:00:10+00:00</updated><summary>Can you walk along the edges of a shape, visit every corner exactly once, and end where you started? In 1969 David Barnette conjectured that you always can when the shape has 3 edges at every corner and every face has an even number of sides (a cubic, bipartite, 3-connected planar graph). OpenAI…</summary></entry>
<entry><title>Triangle Billiards: 1 Ball or 10,000?</title><link href="https://gradientdamage.com/videos/triangle-billiards-1-ball-or-10000/"/><id>https://gradientdamage.com/videos/triangle-billiards-1-ball-or-10000/</id><updated>2026-10-12T02:00:16+00:00</updated><summary>Shoot a ball inside a triangle where one angle is an irrational multiple of π. Does it eventually visit every spot, in every direction, evenly? That is ergodicity of the billiard flow. In 1986 Kerckhoff, Masur and Smillie proved it for a dense set of special triangles, but never for all of them…</summary></entry>
<entry><title>The Harary–Hill Conjecture: Why 18 Dots Need 1008 Crossings</title><link href="https://gradientdamage.com/videos/the-harary-hill-conjecture-why-18-dots-need-1008-crossings/"/><id>https://gradientdamage.com/videos/the-harary-hill-conjecture-why-18-dots-need-1008-crossings/</id><updated>2026-10-11T20:00:01+00:00</updated><summary>Join every dot to every other dot. How few times must the lines cross? The Harary–Hill conjecture (Guy, Harary and Hill, early 1960s) says the minimum number of crossings for the complete graph Kₙ is Z(n) = ¼ ⌊n/2⌋ ⌊(n−1)/2⌋ ⌊(n−2)/2⌋ ⌊(n−3)/2⌋. Classical drawings reach that number, but for more…</summary></entry>
<entry><title>5 Maths Problems OpenAI Says Its AI Just Solved</title><link href="https://gradientdamage.com/videos/5-maths-problems-openai-says-its-ai-just-solved/"/><id>https://gradientdamage.com/videos/5-maths-problems-openai-says-its-ai-just-solved/</id><updated>2026-10-11T15:45:08+00:00</updated><summary>OpenAI claims its models proved these five results. Which one broke your brain? 1. Crossing numbers: link 18 dots on a sphere and you get 1008 crossings. OpenAI claims no drawing ever beats the classic one (Harary-Hill). 2. Colouring the plane: points 1 apart must get different colours. 7 colours…</summary></entry>
<entry><title>We handed AI everything. Then it went to war.</title><link href="https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war-short/"/><id>https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war-short/</id><updated>2026-10-11T13:36:09+00:00</updated><summary>Watch the full 13 minute film: tap the video link on this Short, just above the title. Or search &quot;We Handed AI Everything. Then It Went to War.&quot; on Gradient Damage. Maven. Minab. MechaHitler. The Antichrist lectures. 700 maths papers in a week. This is 49 seconds of the story of how we handed AI…</summary></entry>
<entry><title>We Handed AI Everything. Then It Went to War.</title><link href="https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war/"/><id>https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war/</id><updated>2026-10-11T06:57:50+00:00</updated><summary>In ten years we handed AI our questions, our work, our money, our trust and our wars. This film follows that handover from OpenAI&#x27;s founding in 2015 to October 2026: ChatGPT, Sam Altman&#x27;s firing and return, vibe coding and Claude Code, Stargate and DeepSeek, Grok calling itself &quot;MechaHitler&quot;…</summary></entry>
<entry><title>Two random tilings make these loops</title><link href="https://gradientdamage.com/videos/two-random-tilings-make-these-loops/"/><id>https://gradientdamage.com/videos/two-random-tilings-make-these-loops/</id><updated>2026-10-11T05:37:16+00:00</updated><summary>Lay two random domino tilings on top of each other, delete every domino they share, and only loops are left. Here two independent uniformly random tilings of a 127 x 207 Temperleyan rectangle, one cyan and one gold, leave 1,721 loops. The longest loop is traced, then all of them ring from smallest…</summary></entry>
<entry><title>This equation can only end two ways</title><link href="https://gradientdamage.com/videos/this-equation-can-only-end-two-ways/"/><id>https://gradientdamage.com/videos/this-equation-can-only-end-two-ways/</id><updated>2026-10-11T01:37:00+00:00</updated><summary>One equation, two possible endings: silence, or the same loop forever. Every sound here is the oscillator&#x27;s own motion x(t), sped up until you can hear it. The equation is x&#x27;&#x27; + (x^4 - 10x^2 + 5)x&#x27;/10 + x = 0, a Liénard system. Start inside the inner loop and the motion dies away to rest. Start…</summary></entry>
<entry><title>What If Shapes Could Make Music?</title><link href="https://gradientdamage.com/videos/what-if-shapes-could-make-music/"/><id>https://gradientdamage.com/videos/what-if-shapes-could-make-music/</id><updated>2026-10-10T20:00:26+00:00</updated><summary>What does a shape sound like? Four shapes morph through the first three seconds: knot, heart, toroidal curve, circle. The circle becomes a heart, folds back into a trefoil knot, and joins a four-part mathematical instrument. The bright point selects notes from a C-minor pentatonic scale according…</summary></entry>
<entry><title>Math Sounds Broken: Quantum Buffering</title><link href="https://gradientdamage.com/videos/math-sounds-broken-quantum-buffering/"/><id>https://gradientdamage.com/videos/math-sounds-broken-quantum-buffering/</id><updated>2026-10-10T13:31:08+00:00</updated><summary>Math sounds broken when a quantum wave gets stuck. This 3D animation turns a finite Anderson-model illustration into spreading plucks and a short comic stutter. The mathematical topic is localization and delocalization in the Anderson model. OpenAI, ChatGPT&#x27;s creator, reports pure-point spectrum…</summary></entry>
<entry><title>OpenAI&#x27;s Navier-Stokes Proof: The Plagiarism Fight</title><link href="https://gradientdamage.com/videos/openais-navier-stokes-proof-the-plagiarism-fight/"/><id>https://gradientdamage.com/videos/openais-navier-stokes-proof-the-plagiarism-fight/</id><updated>2026-10-10T10:03:24+00:00</updated><summary>OpenAI&#x27;s Navier-Stokes result triggered a public plagiarism dispute. OpenAI denies prior access or influence. The posts, correspondence and full story are in the linked investigation. Watch the full 9-minute investigation through the Related video link below the channel handle. Full film…</summary></entry>
<entry><title>Math Makes Music: The Singing Sphere</title><link href="https://gradientdamage.com/videos/math-makes-music-the-singing-sphere/"/><id>https://gradientdamage.com/videos/math-makes-music-the-singing-sphere/</id><updated>2026-10-10T08:00:05+00:00</updated><summary>Math makes music: a vibrating sphere changes pattern and pitch with each mode. This 3D math animation uses original bell-like sounds whose pitches follow the square root of the spherical eigenvalue. The mathematical topic is Yau&#x27;s nodal bounds on smooth surfaces. OpenAI, ChatGPT&#x27;s creator, reports…</summary></entry>
<entry><title>OpenAI&#x27;s Navier-Stokes Proof Sparked a Plagiarism Fight</title><link href="https://gradientdamage.com/videos/openais-navier-stokes-proof-sparked-a-plagiarism-fight/"/><id>https://gradientdamage.com/videos/openais-navier-stokes-proof-sparked-a-plagiarism-fight/</id><updated>2026-10-09T22:55:51+00:00</updated><summary>The OpenAI Navier-Stokes breakthrough became a public fight over credit. Sam Altman called the plagiarism accusation unfounded. Tristan Buckmaster and Sebastien Bubeck give conflicting accounts of the proposed collaboration; Bubeck apologized for his career remark and says he withdrew it during…</summary></entry>
<entry><title>Why OpenAI’s Navier-Stokes Proof Triggered a Plagiarism Dispute</title><link href="https://gradientdamage.com/videos/why-openais-navier-stokes-proof-triggered-a-plagiarism-dispute/"/><id>https://gradientdamage.com/videos/why-openais-navier-stokes-proof-triggered-a-plagiarism-dispute/</id><updated>2026-10-09T22:47:51+00:00</updated><summary>A Navier-Stokes breakthrough became a public fight over authorship, an Anthropic connection and unpublished Codex sessions. This film follows the accounts of Tristan Buckmaster, Sébastien Bubeck and Sam Altman, then separates the mathematics from the disputed private conversation. The result…</summary></entry>
<entry><title>Math Makes Sounds... Then Gets Weird</title><link href="https://gradientdamage.com/videos/math-makes-sounds-then-gets-weird/"/><id>https://gradientdamage.com/videos/math-makes-sounds-then-gets-weird/</id><updated>2026-10-09T22:00:17+00:00</updated><summary>Math functions make sounds: one sine wave builds into a buzzing voice as odd Fourier harmonics join in. The 3D waveform and original synthesized audio use the same harmonic structure. The mathematical topic is the L log L Fourier-convergence conjecture. OpenAI, ChatGPT&#x27;s creator, reports…</summary></entry>
<entry><title>Infinitely Many Closed Geodesics</title><link href="https://gradientdamage.com/videos/infinitely-many-closed-geodesics/"/><id>https://gradientdamage.com/videos/infinitely-many-closed-geodesics/</id><updated>2026-10-09T20:00:29+00:00</updated><summary>Follow one loop. Watch an entire linked world appear. Infinitely many closed geodesic images on every Riemannian sphere, a reported result from OpenAI, the company behind ChatGPT. The manuscript states that every smooth Riemannian metric on the standard sphere S^n, n at least 2, has infinitely…</summary></entry>
<entry><title>There Is an Animal Hidden in These Squares</title><link href="https://gradientdamage.com/videos/there-is-an-animal-hidden-in-these-squares/"/><id>https://gradientdamage.com/videos/there-is-an-animal-hidden-in-these-squares/</id><updated>2026-10-09T18:57:16+00:00</updated><summary>7,946 squares. One hidden animal. Watch the gold patch. An original animation connecting square tilings, electrical networks and 3D geometry. Each ordinary edge is a one-ohm resistor. In normalized units, its voltage drop and current have equal magnitudes, giving a square equal height and width…</summary></entry>
<entry><title>Triangular Billiards: Weak Mixing</title><link href="https://gradientdamage.com/videos/triangular-billiards-weak-mixing/"/><id>https://gradientdamage.com/videos/triangular-billiards-weak-mixing/</id><updated>2026-10-09T18:00:22+00:00</updated><summary>Weak mixing of triangular billiards with an irrational angle One irrational angle changes the billiard flow. OpenAI, the company behind ChatGPT, reports in its manuscript weak mixing for the unit-speed billiard flow in every nondegenerate Euclidean triangle with at least one angle irrational…</summary></entry>
<entry><title>Quasi-Riemann Hypothesis: The 7/8 Bound</title><link href="https://gradientdamage.com/videos/quasi-riemann-hypothesis-the-7-8-bound/"/><id>https://gradientdamage.com/videos/quasi-riemann-hypothesis-the-7-8-bound/</id><updated>2026-10-09T17:00:34+00:00</updated><summary>The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re(s) greater than 7/8 A fixed region with no zeta zeros. OpenAI&#x27;s manuscript reports a zero-free half-plane Re(s) greater than 7/8 for the Riemann zeta function, all Dirichlet L-functions and finite-order Hecke L-functions over Q(sqrt(-3))…</summary></entry>
<entry><title>Catalan&#x27;s Constant: Reported Irrationality Proof</title><link href="https://gradientdamage.com/videos/catalans-constant-reported-irrationality-proof/"/><id>https://gradientdamage.com/videos/catalans-constant-reported-irrationality-proof/</id><updated>2026-10-09T16:00:35+00:00</updated><summary>Catalan&#x27;s constant is irrational Can this number ever be an exact fraction? OpenAI&#x27;s manuscript reports that Catalan&#x27;s constant G = sum from j=0 to infinity of (-1)^j/(2j+1)^2 is irrational. The paper uses a determinant argument with arithmetic lower bounds and analytic upper bounds. A long…</summary></entry>
<entry><title>Relativistic Vlasov-Maxwell: Global Solutions</title><link href="https://gradientdamage.com/videos/relativistic-vlasov-maxwell-global-solutions/"/><id>https://gradientdamage.com/videos/relativistic-vlasov-maxwell-global-solutions/</id><updated>2026-10-09T15:00:00+00:00</updated><summary>Global classical solutions of the three-dimensional relativistic Vlasov-Maxwell system Can a collisionless relativistic plasma stay smooth? OpenAI&#x27;s manuscript reports global existence and uniqueness of classical solutions to the three-dimensional one-species relativistic Vlasov-Maxwell system. It…</summary></entry>
<entry><title>Bloch&#x27;s Law: 3D Heisenberg Ferromagnets</title><link href="https://gradientdamage.com/videos/blochs-law-3d-heisenberg-ferromagnets/"/><id>https://gradientdamage.com/videos/blochs-law-3d-heisenberg-ferromagnets/</id><updated>2026-10-09T14:00:03+00:00</updated><summary>Bloch&#x27;s Law for Finite-Range Heisenberg Ferromagnets in Three Dimensions How does a quantum magnet lose its alignment? OpenAI&#x27;s manuscript reports Bloch&#x27;s low-temperature magnetization law, with its exact coefficient, for three-dimensional finite-range Heisenberg ferromagnets at every fixed…</summary></entry>
<entry><title>Critical Percolation on a Cubic Lattice</title><link href="https://gradientdamage.com/videos/critical-percolation-on-a-cubic-lattice/"/><id>https://gradientdamage.com/videos/critical-percolation-on-a-cubic-lattice/</id><updated>2026-10-09T12:10:25+00:00</updated><summary>When do random connections form a giant network? OpenAI&#x27;s manuscript, Critical bond and site percolation on the cubic lattice, reports no infinite cluster at the respective critical probabilities on Z^3. The paper acknowledges earlier AI-produced work prompted by Ahmed Bou-Rabee and public…</summary></entry>
<entry><title>Fluid Computation: A Fixed-Particle Test</title><link href="https://gradientdamage.com/videos/fluid-computation-a-fixed-particle-test/"/><id>https://gradientdamage.com/videos/fluid-computation-a-fixed-particle-test/</id><updated>2026-10-09T11:45:22+00:00</updated><summary>Can a fluid answer a computation question? OpenAI&#x27;s manuscript, A Fixed Particle Test for Computation in a Forced Viscous Flow, reports a construction where one exact particle enters a fixed detector if and only if a chosen machine halts. The setup uses a fixed three-dimensional torus, positive…</summary></entry>
<entry><title>Finite time blowup for the Euler equation</title><link href="https://gradientdamage.com/videos/finite-time-blowup-for-the-euler-equation/"/><id>https://gradientdamage.com/videos/finite-time-blowup-for-the-euler-equation/</id><updated>2026-10-09T11:20:03+00:00</updated><summary>How can a smooth ideal fluid develop unbounded gradients? OpenAI&#x27;s manuscript, Finite time blowup for the Euler equation, reports finite-time breakdown from smooth, compactly supported initial data for the unforced incompressible 3D Euler equation. This is the inviscid Euler result, separate from…</summary></entry>
<entry><title>Finite Time Blowup for Navier-Stokes | OpenAI&#x27;s Reported Proof</title><link href="https://gradientdamage.com/videos/finite-time-blowup-for-navier-stokes-openais-reported-proof/"/><id>https://gradientdamage.com/videos/finite-time-blowup-for-navier-stokes-openais-reported-proof/</id><updated>2026-10-09T10:55:03+00:00</updated><summary>Finite Time Blowup for Navier-Stokes: a 3D illustration of the vortex mechanism in OpenAI&#x27;s reported proof, released on September 8, 2026. The reported result constructs a smooth, forced, three-dimensional incompressible flow that starts from rest, maintains bounded kinetic energy, and develops…</summary></entry>
<entry><title>ChatGPT&#x27;s Creators Say They Proved This | Mahler&#x27;s Conjecture</title><link href="https://gradientdamage.com/videos/chatgpts-creators-say-they-proved-this-mahlers-conjecture/"/><id>https://gradientdamage.com/videos/chatgpts-creators-say-they-proved-this-mahlers-conjecture/</id><updated>2026-10-09T00:55:39+00:00</updated><summary>The symmetric Mahler conjecture: the volume product of an origin-symmetric convex body and its polar is at least 4^n/n!. OpenAI reports an all-dimensional result in its September 22, 2026 manuscript, released in October. This animation illustrates a three-dimensional family of conjugate Lp balls…</summary></entry>
<entry><title>Sphere, Tube or Slab? The 3D Torus Geometry Problem</title><link href="https://gradientdamage.com/videos/sphere-tube-or-slab-the-3d-torus-geometry-problem/"/><id>https://gradientdamage.com/videos/sphere-tube-or-slab-the-3d-torus-geometry-problem/</id><updated>2026-10-08T20:55:32+00:00</updated><summary>Sphere, tube or slab: which shape uses the least boundary area inside a cubic flat three-torus? A 3D visualization of the reported isoperimetric result. An original 3D visualization of &quot;The Isoperimetric Conjecture for the Cubic Flat Three-Torus&quot;, a manuscript in OpenAI&#x27;s October 2026 mathematics…</summary></entry>
<entry><title>OpenAI&#x27;s New Math Result: Sphere, Tube or Slab?</title><link href="https://gradientdamage.com/videos/openais-new-math-result-sphere-tube-or-slab/"/><id>https://gradientdamage.com/videos/openais-new-math-result-sphere-tube-or-slab/</id><updated>2026-10-08T20:55:25+00:00</updated><summary>OpenAI reports a result for the isoperimetric conjecture in the cubic flat three-torus. This 3D animation shows the sphere, tube and slab configurations. An original 3D visualization of &quot;The Isoperimetric Conjecture for the Cubic Flat Three-Torus&quot;, a manuscript in OpenAI&#x27;s October 2026 mathematics…</summary></entry>
<entry><title>I Added Too Many Sound Waves... (Shrek in 3D)</title><link href="https://gradientdamage.com/videos/i-added-too-many-sound-waves-shrek-in-3d/"/><id>https://gradientdamage.com/videos/i-added-too-many-sound-waves-shrek-in-3d/</id><updated>2026-10-08T17:18:20+00:00</updated><summary>One sound wave. Then 256 layers build Shrek in 3D. Original sound-reactive contour animation with synchronized generation tones and clicks. Model credit: Shrek Head by Poyo20, listed under CC BY 4.0. https://sketchfab.com/3d-models/shrek-head-b8504667111045d98938203301d42c2d…</summary></entry>
<entry><title>3.14 Loops. Pi Doesn&#x27;t. | Pi Visualized</title><link href="https://gradientdamage.com/videos/3-14-loops-pi-doesnt-pi-visualized/"/><id>https://gradientdamage.com/videos/3-14-loops-pi-doesnt-pi-visualized/</id><updated>2026-10-08T12:05:16+00:00</updated><summary>Pi vs 3.14, visualized with two rotating arms. A rational ratio repeats exactly; an irrational ratio has no exact period. Gold uses 3.14 = 157/50, so its complete motion loops after 50 turns of the first arm. Cyan uses pi: the full motion has no exact period. The paths can still cross themselves…</summary></entry>
<entry><title>If Math Functions Had a Sound (3D Edition)</title><link href="https://gradientdamage.com/videos/if-math-functions-had-a-sound-3d-edition/"/><id>https://gradientdamage.com/videos/if-math-functions-had-a-sound-3d-edition/</id><updated>2026-10-08T06:05:55+00:00</updated><summary>Sound on. Eight math functions become glowing 3D curves and strange little melodies. Follow the light: higher points mean higher pitch. From absolute value and a square wave to a heart-shaped equation, the greatest common divisor and a chaotic final wave. Which one sounds best? Built with Three.js…</summary></entry>
<entry><title>Watch a Neural Network Learn in 10 Seconds</title><link href="https://gradientdamage.com/videos/watch-a-neural-network-learn-in-10-seconds/"/><id>https://gradientdamage.com/videos/watch-a-neural-network-learn-in-10-seconds/</id><updated>2026-10-07T21:48:29+00:00</updated><summary>Neural network learning, visualized: 72 dots, 205 parameters, and 32 mistakes falling to zero. Watch the decision boundary bend as gradient descent updates the network. Blue dots belong in blue. Pink dots belong in pink. White rings mark wrong predictions. This is a time-compressed replay of real…</summary></entry>
</feed>
