Leveled up in the Great Gas Reckoning with ETHGas! 💪
Legendary Jack status: 7.0858 ETH gas spent, 4000 Beans earned—supporting the Gasless Future!
Claim your Gas ID at https://t.co/3r9kKFuiBl
Chinese researchers have developed the best shortest-path algorithm in 41 years!
Dijkstra’s Algorithm has been the undefeated king of the shortest path for over 40 years.
Whether you’re using Google Maps, booking a flight, or routing internet packets, Dijkstra is the engine running in the background.
Since 1984, textbooks have taught that its efficiency was hit by a "sorting barrier."
To find the shortest path, you have to sort the points by distance. And sorting has a mathematical floor you can’t cross.
Until now.
A research team from Tsinghua University just published a paper that shatters the 41-year-old record.
They proved that Dijkstra is not optimal.
By combining the logic of the Bellman-Ford algorithm with a revolutionary "recursive partial ordering" method, they figured out how to find the path without fully sorting the nodes.
The results are a massive shift in theoretical computer science:
- The first deterministic improvement to the Single-Source Shortest Path (SSSP) problem since 1984.
- A new time complexity of $ O(m \log^{2/3} n)$, officially beating the long-standing $ O(m + n \log n)$ limit.
- On massive sparse graphs (like the web or global logistics), this means finding the best route significantly faster than previously thought possible.
For four decades, the greatest minds in algorithms believed this limit was absolute.
Last year, even the legendary Robert Tarjan won an award proving Dijkstra was "optimally efficient" at sorting distances.
Tsinghua’s answer? Stop sorting.
The world’s most settled problem is suddenly wide open again.
If we can break a 40-year-old law in basic graph theory, what other "impossible" speed limits are waiting to be crushed?
No need to cope since majority of the people who didn’t lock their tokens for an entire year didn’t get an allocation/ only got a very small portion of their committed funds.
gonna be coping so hard over megaeth today
bidded $160k and only got a $2650 allocation during the public sale.
if price stays where it’s at, presale participants are looking at almost 2x return
the public sale cleared at $0.0999 per token (~$1b fdv). current pre-market price is hovering around $0.195, putting fdv at $1.95b
many people i know have 5 figs to over $100k in this.
with the way it’s looking, this will be easily the biggest win of 2026 q1-q2
that's why it's always so important to protect your capital for opportunities like this - when they finally come, you want enough dry powder to be able to participate in it
good luck everyone!
Introducing Claude Design by Anthropic Labs: make prototypes, slides, and one-pagers by talking to Claude.
Powered by Claude Opus 4.7, our most capable vision model. Available in research preview on the Pro, Max, Team, and Enterprise plans, rolling out throughout the day.
Introducing Website to App.
Turn any website into an native mobile app.
Just paste a URL.
Claude Opus 4.6 will code, design, launch and translate a mobile app inspired by the original website.
We’ve been using this internally a ton for iOS/Android apps.
Petit Planet Stardrift Test Begins April 21!
Some seek answers in the stars, yet those answers have long been sown in life. And so, a flower blooms on this planet.
RP now to join our Trailer Giveaway — instant results await you!
DIGIMON UP Release Date Celebration Campaign
Summon Tickets you can use in-game will be sent to all players based on the number of new followers across all accounts during this Campaign period!
Follow the official account @Digimon_up_en and repost this post to get rewards!
#digimon #DigimonUP