Tootfinder

If you thought you would be missing the Tour de France in the UK this year. Highlights will be on Channel 5, but all stages of the race will be shown live on S4C at 2pm every day, with a highlights programme every night. Follow all the action on S4C, S4C Clic, BBC iPlayer and S4C’s YouTube. #TourDeFrance #LeTour

Auch bei der #TourDeFrance gibt es #Fahrradalltag.
#TDF2026 #letour

🇺🇦 #NowPlaying on #BBC6Music's #HuwStephensRoundtable
Truthpaste:
🎵 Never Gonna Give
#Truthpaste
#newRelease 🆕 single
https://open.spotify.com/track/2FmKeSugXWcZMlhynAgONf

Supabase, which provides backend tools for building AI apps, raised a $500M Series F led by GIC at a $10B pre-money valuation, up from $5B in October 2025 (CJ Haddad/CNBC)
https://www.cnbc.com/2026/06/04/database-startup-supabase-r…

Vibe-coding phenomenon lifts AI startup Supabase to $10.5 billion valuation
Database startup Supabase announced a $500 million funding round that values the company at $10.5 billion, including the fresh capital.

from my link log —
D as a C replacement.
https://theartofmachinery.com/2019/04/05/d_as_c_replacement.html
saved 2019-07-03 https://…

Why did the press ignore a gathering of the world's leading fascists? (Charles R. Davis/The Redoubt)
https://www.theredoubt.net/why-did-the-press-ignore-a-gathering-of-the-worlds-leading-fascists/
http://www.memeorandum.com/260601/p44#a260601p44

This is such a sweet story…
#bikeTooter #cycling

I Rode My First Gravel Race at 53 and Became a Cyclist on the Way
For Summer Russo, a self-described big-bodied rider who had never touched gravel, the path to riding 54 miles of Oklahoma red dirt at the 2026 Mid South gravel race began not with a plan, but with a heart that said yes before her mind could talk her out of it. At 53, with a 34-mile personal record to her name, Summer joined the All Bodies on Bikes gravel team – a program built on the radical premise that cycling belongs to every body – and discovered something she hadn't been looking for: h…

Just wrote a fun little algorithm for iterating through all grid positions within X euclidean distance from a center, roughly in order of distance but also mostly ensuring each position yielded is at least diagonally adjacent to the previous. It's a fun problem to think about with lots of design tradeoffs and many valid solutions.
My solution requires that the origin be on the grid (I think?) and uses a bunch of caching instead of a bajillion distance checks, although I don't actually know what the memory/speed tradeoff is like or whether there are any gains at all (could be net losses, which I'm starting to wonder about more as I write this post). Thankfully I don't expect performance to be very critical here anyways, and doing the caching actually helped separate some logic in a useful way.
A fun little diversion from bigger stuff in the project and a reminder of some of the joys of programming design at a small scope. Feels kinda like mastering the local town's minigame while you're stuck on the main quest in an RPG.
#programming

Crosslisted article(s) found for cs.OS. https://arxiv.org/list/cs.OS/new
[1/1]:
- CarbonSim: A Lifecycle-Aware Framework for Evaluating Carbon Tradeoffs in Hardware Upgrade Decisions
Kartik Hans, Kaiwen Zhao, Stephen Lee
https://arxiv.org/abs/2606.06438 https://mastoxiv.page/@arXiv_csDC_bot/116696466987255241
toXiv_bot_toot

🇺🇦 #NowPlaying on #BBC6Music's #CerysMatthews
The Yardbirds:
🎵 The Sun Is Shining - Live
#TheYardbirds
https://open.spotify.com/track/4hACd55K9rLQ3fFDPCHHIt