<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Notes · Charles Poli</title><description>Short notes on the breakthroughs behind Charles Poli&apos;s open-source toolkits, with runnable examples.</description><link>https://cpoli.github.io/</link><language>en-gb</language><item><title>The Riemann hypothesis may have just fallen. Here is what it says.</title><link>https://cpoli.github.io/notes/riemann-hypothesis/</link><guid isPermaLink="true">https://cpoli.github.io/notes/riemann-hypothesis/</guid><description>On 20 November 2026 a machine-checked proof of the Riemann hypothesis was announced. It is not verified yet, but this is the most serious attempt in 167 years. What the conjecture says, why primes care, and how to explore it in a few lines of Python.</description><pubDate>Sat, 21 Nov 2026 00:00:00 GMT</pubDate></item></channel></rss>