I'd rather be in outer space 🛸

No title available
No title available
TVSTRANGERTHINGS
noise dept.
Cosimo Galluzzi

izzy's playlists!
art blog(derogatory)
h

blake kathryn

Product Placement
No title available
🩵 avery cochrane 🩵
EXPECTATIONS
Aqua Utopia|海の底で記憶を紡ぐ
YOU ARE THE REASON

Origami Around
2025 on Tumblr: Trends That Defined the Year

roma★

#extradirty
seen from United States
seen from Brazil
seen from Vietnam
seen from United Kingdom
seen from Spain
seen from United States
seen from Uruguay

seen from Brazil
seen from Brazil
seen from Russia
seen from Russia
seen from Canada

seen from India
seen from South Africa

seen from Türkiye
seen from Italy

seen from United States

seen from Japan

seen from Algeria
seen from Costa Rica
@herearesomecomputerthings-blog
using 12 bits to represent many useful 32-bit integers
djb has a blog now high five
stories about encounters with people in dayz
gcc's stack canaries are smarter than you think
quickly finding malicious tor exit relays (https mitm, html injection, and more)
python ide for the ios; you can export as xcode projects SOMEHOW
a music video for "praise you" fatboy slim
escalate privileges to root on any device you have a firewire/thunderbolt connection to
Úlfar Erlingsson, Mukkai Krishnamoorthy and T.V. Raman.
Information Processing Letters 60
We present a new scheme for building static search trees, using multiway radix search. We apply this method to the problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three branches for the average search. We give timing results that show that in practice our method runs faster than other methods on large sparse case sets.
Seems like this might be relevant to code-generation for match statements, which make up a really significant chunk of Rust code.
better gc, cluster round-robin scheduling, tls improvements, faster crypto
a gradual introduction to tensors