Yac⚡

An alien 👽, since I was born on the wrong planet.. 🖖🏻

Oh, yes.. ⚡the orange flash that will improve humanity is inevita₿le.
#Freedom first.

[Yac⚡ @_Yac_]

Wake up from the apathy! #Bitcoin

[Yac⚡ @_Yac_]

@signalapp

[Yac⚡ @_Yac_]

@saylor @Excellion You have a lot of Bitcoin, use some to create lightning nodes and help make the network more resilient and accelerate global adoption.

[Yac⚡ @_Yac_]

@p_eng_uin

[Yac⚡ @_Yac_]

@LozzaFox

[Yac⚡ @_Yac_]

@alejandronimoAr @JMilei I'm still waiting for the Argentine central bank to close, until that day he will be one of the many politicians who makes promises, unfortunately

[Yac⚡ @_Yac_]

@Mathieson4426 @Ferrari

[Yac⚡ @_Yac_]

@saylor @time2trade If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@Strategy If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@saylor @JoeConsorti If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@Strategy @time2trade If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@saylor @ronin21btc If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@saylor If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@saylor If you made several lightning nodes, you would help the structure be more antifragile as well as earn sats from routing payments, think about it..

[Yac⚡ @_Yac_]

@saylor 👇
https://t.co/QRdRpdiI1i

[Yac⚡ @_Yac_]

@GiorgiaMeloni Troppe tasse pagate da una minoranza, questa è l'Italia.
https://t.co/fn81fbct0S

[Autism Capital 🧩 @AutismCapital]

If you watch YouTube you likely know Davie504, the bass guy. He decided to finally leave Italy. After paying 60% in taxes he STILL got raided by the Italian Financial Police because he was a YouTuber.

He says that though Italy says that the 60% taxes pay for free services it's not actually free. He says healthcare is "free" but the waiting list is 6-12 months anyways for a simple scan so you get scared and use a private clinic and pay out of pocket anyways so you're basically being double dipped.

"In Italy you need a stamp, then a different stamp, then an appointment that's three months away, then you show up to an office then its closed, then you realize you need to know people and participate in bribe culture."

These type of systems are untenable and people will flee to places they are welcomed and can thrive.

"Loving a country that doesn't love you back is exhausting. You can't live on memories alone. You can't pay your rent with culture."

"As an entrepreneur you want to focus on your craft and create, but in Italy it felt like 70% of my energy was spent trying to deal with a system."

Worth watching the whole video. This is the future of the United States if things continue down a certain path.

https://t.co/vqjDDXerlK

[Yac⚡ @_Yac_]

@JoelKatz

[Yac⚡ @_Yac_]

@federico_rivi @Atlas21_ita @danielabrozzoni Gran bella puntata, ora in attesa per la parte 2. Grazie a entrambi

[Yac⚡ @_Yac_]

@giacomozucco Instead, let's look to the future. Is it possible that this new algorithm could find an application in LN payment routing?
👇
https://t.co/CzPfeQ5ELC

[Brian Roemmele @BrianRoemmele]

Dijkstra’s Algorithm Just Got Dethroned After 41 Years And the Future of Navigation, Logistics, and AI Just Got WAY Faster!

Imagine this: For over six decades, Edsger Dijkstra’s legendary algorithm has quietly powered everything that moves data, people, or packets across networks.

Google Maps rerouting you around traffic in real time? Dijkstra. Booking the cheapest flight with optimal connections?

Dijkstra. Internet routers blasting your cat videos across the globe at lightning speed? You guessed it, Dijkstra.

Textbooks declared it unbeatable on sparse graphs since 1984. Even the great Robert Tarjan snagged an award last year essentially saying, “Yeah, this is as good as it gets.”

The “sorting barrier” felt like a law of physics.

Until now.

A brilliant team from Tsinghua University (led by Professor Ran Duan) just dropped a bombshell paper that shatters that 41-year-old ceiling.

They’ve created the first deterministic algorithm to beat Dijkstra’s classic O(m + n log n) time bound for the Single-Source Shortest Path (SSSP) problem on directed graphs with real weights.

The New Champion: O(m log^{2/3} n) — Mind-Blowingly Faster on Massive Graphs

Their breakthrough? They stopped obsessing over fully sorting every node by distance.

Instead, they fused the relaxation power of the Bellman-Ford algorithm with a genius “recursive partial ordering” technique. This cleverly shrinks the “frontier” of candidate nodes you need to track, avoiding the full logarithmic sorting hit that’s haunted Dijkstra for decades.

On huge sparse graphs (think the web, global supply chains, social networks, or road systems), this translates to significantly faster route-finding. We’re talking real theoretical wins that could cascade into practical speedups as implementations mature.

This isn’t some incremental tweak — it’s the first major deterministic improvement since 1984, and it just won Best Paper at STOC 2025.

Science is self-correcting in the most exhilarating way possible!

Why This Feels Like Magic
Dijkstra works by always picking the next closest unprocessed node elegant, but it forces you to maintain a sorted order.

The Tsinghua team said: “What if we don’t need the full order right away?”

They use divide-and-conquer on vertex sets, bounded multi-source subproblems, and smart pivots to compress the work. It’s like navigating a city by smartly grouping neighborhoods instead of checking every single streetlight one by one.

Robert Tarjan himself called it “amazing.” When a legend in the field reacts like that, you know history is being rewritten.

What This Means for the Real World

• Navigation & Maps: Faster dynamic rerouting on planetary-scale graphs. Traffic apps could feel even snappier.
• Logistics & Supply Chains: Optimizing millions of routes in less time = lower costs, greener deliveries, happier planets.
• Networking: Internet infrastructure could route packets more efficiently than ever.
• AI & Games: Pathfinding in massive virtual worlds or graph-based ML models gets a turbo boost.
• Beyond: This cracks open the door for rethinking other “impossible” barriers in algorithms. If we can beat sorting here, what else is waiting?

Implementations in libraries like NetworkX or Boost Graph are coming, and the entire algorithms community is buzzing.

What a time to be alive in tech!
Tsinghua just proved that even the most sacred cows in computer science aren’t untouchable.

The sorting barrier?

Obliterated.

The shortest-path problem isn’t solved, it’s reopened for even greater conquests.

[Yac⚡ @_Yac_]

👀

[Brian Roemmele @BrianRoemmele]

Dijkstra’s Algorithm Just Got Dethroned After 41 Years And the Future of Navigation, Logistics, and AI Just Got WAY Faster!

Imagine this: For over six decades, Edsger Dijkstra’s legendary algorithm has quietly powered everything that moves data, people, or packets across networks.

Google Maps rerouting you around traffic in real time? Dijkstra. Booking the cheapest flight with optimal connections?

Dijkstra. Internet routers blasting your cat videos across the globe at lightning speed? You guessed it, Dijkstra.

Textbooks declared it unbeatable on sparse graphs since 1984. Even the great Robert Tarjan snagged an award last year essentially saying, “Yeah, this is as good as it gets.”

The “sorting barrier” felt like a law of physics.

Until now.

A brilliant team from Tsinghua University (led by Professor Ran Duan) just dropped a bombshell paper that shatters that 41-year-old ceiling.

They’ve created the first deterministic algorithm to beat Dijkstra’s classic O(m + n log n) time bound for the Single-Source Shortest Path (SSSP) problem on directed graphs with real weights.

The New Champion: O(m log^{2/3} n) — Mind-Blowingly Faster on Massive Graphs

Their breakthrough? They stopped obsessing over fully sorting every node by distance.

Instead, they fused the relaxation power of the Bellman-Ford algorithm with a genius “recursive partial ordering” technique. This cleverly shrinks the “frontier” of candidate nodes you need to track, avoiding the full logarithmic sorting hit that’s haunted Dijkstra for decades.

On huge sparse graphs (think the web, global supply chains, social networks, or road systems), this translates to significantly faster route-finding. We’re talking real theoretical wins that could cascade into practical speedups as implementations mature.

This isn’t some incremental tweak — it’s the first major deterministic improvement since 1984, and it just won Best Paper at STOC 2025.

Science is self-correcting in the most exhilarating way possible!

Why This Feels Like Magic
Dijkstra works by always picking the next closest unprocessed node elegant, but it forces you to maintain a sorted order.

The Tsinghua team said: “What if we don’t need the full order right away?”

They use divide-and-conquer on vertex sets, bounded multi-source subproblems, and smart pivots to compress the work. It’s like navigating a city by smartly grouping neighborhoods instead of checking every single streetlight one by one.

Robert Tarjan himself called it “amazing.” When a legend in the field reacts like that, you know history is being rewritten.

What This Means for the Real World

• Navigation & Maps: Faster dynamic rerouting on planetary-scale graphs. Traffic apps could feel even snappier.
• Logistics & Supply Chains: Optimizing millions of routes in less time = lower costs, greener deliveries, happier planets.
• Networking: Internet infrastructure could route packets more efficiently than ever.
• AI & Games: Pathfinding in massive virtual worlds or graph-based ML models gets a turbo boost.
• Beyond: This cracks open the door for rethinking other “impossible” barriers in algorithms. If we can beat sorting here, what else is waiting?

Implementations in libraries like NetworkX or Boost Graph are coming, and the entire algorithms community is buzzing.

What a time to be alive in tech!
Tsinghua just proved that even the most sacred cows in computer science aren’t untouchable.

The sorting barrier?

Obliterated.

The shortest-path problem isn’t solved, it’s reopened for even greater conquests.

[Yac⚡ @_Yac_]

@AngeloniFilippo 👇 fatto 👇
https://t.co/0yBDsQuGtw

[Yac⚡ @_Yac_]

@AngeloniFilippo Carino anche questo. Magari se ho tempo pubblico il mio su GitHub la prox settimana