Pranav Velamakanni

Huge computer science result: A Tsinghua professor JUST discovered the fastest shortest path algorithm for graphs in 40yrs. This improves on Turing award winner Tarjan’s O(m + nlogn) with Dijkstra’s, something every Computer Science student learns in college.

Introducing Willow, our new state-of-the-art quantum computing chip with a breakthrough that can reduce errors exponentially as we scale up using more qubits, cracking a 30-year challenge in the field. In benchmark tests, Willow solved a standard computation in <5 mins that would take a leading supercomputer over 10^25 years, far beyond the age of the universe(!).

No More GIL! the Python team has officially accepted the proposal. Congrats @colesbury on his multi-year brilliant effort to remove the GIL, and a heartfelt thanks to the Python Steering Council and Core team for a thoughtful plan to make this a reality. discuss.python.org/t/a-steering-c…

Episode two! A little more dragon psychology with a bit of Van Gogh thrown in. podcasts.apple.com/us/podcast/rev…

There are 43,252,003,274,489,856,000 possible arrangements of a Rubik's Cube. 😮 It was invented by Hungarian professor of architecture Ernő Rubik in 1974. Today it is considered as one of the world's best selling toys.

Liftoff!