Why not just use Linux, I never understood devs obsession with mac when every fucking backend is built for and deployed on Linux!
Whatever advantageous macOS had are diminishing with @omarchy !
Man... I was running my bench with Fable 5.2.. it was running on a Mac, and you cannot really test containers on a Mac. So, it downloaded a Linux kernel, wrote its own little virtual machine launcher, booted a real Linux system on the Mac, and ran 159 end-to-end checks inside it. Nobody asked it to do that.
I have not seen another model do it on my bench.
4
Sachin retweeted
To put this in perspective, some object storage fleets can likely cut CPU core counts by 4-8x.
We built the fastest object storage client (that we know of) from scratch in Zig, and TigerStyle'd it.
For the curious, the story! By @georg_kreuzmayr.
youtu.be/NJrqmoNpVGg
Ryan Dahl ladies and gentleman!
it's shocking that software engineering has transitioned to 100% AI written in such a short time.
it's more shocking that somehow we, the SWEs, are all just continuing on as if nothing happened. It writes C++ better than I ever could, but the problem of making sure it works didn't magically disappear. we are just shipping enormously more volume at higher quality.
19
Sachin retweeted
it's shocking that software engineering has transitioned to 100% AI written in such a short time.
it's more shocking that somehow we, the SWEs, are all just continuing on as if nothing happened. It writes C++ better than I ever could, but the problem of making sure it works didn't magically disappear. we are just shipping enormously more volume at higher quality.
Omarchy is forever free. There's no monetization scheme coming. I'm already rich and the Omacom Foundation is a well-founded nonprofit.
The only ulterior motive here is to make Linux win on the desktop and create the perfect, malleable computer for all to enjoy!
Sachin retweeted
We have a zero dependencies rebuild of Tempo in Zig that outperforms our Rust code and tracks mainnet.
It’s inspired by Tigerbeetle and uses DST. 10x less LOC / 7x less build time.
Very alpha, but a glimpse of the future.
@laibe cooked.
3 AM I'm putting @TigerBeetleDB under real load, watching it from eyes of Triangulator(the little process sampler/profiler I've been building).
70-85k transfers/s, mixed reads and writes, for minutes on end. @jorandirkgreef
the memory map(especially Virtual address space), and it made me smile. 🧵
Nearly all of its address space is plain anonymous memory, with one 1.7 GiB block reserved at startup. Zero major page faults the whole run. Even io_uring shows up neatly in the map.
1
2
72
I am trying to build Triangulator's sampler with TygerStyle, learning so much in the process and from @TigerBeetleDB
github.com/breakbadsp/triang…
3
67
Studied and pictured a Linux process's virtual address space many times, but watching it live in a real app hits different.
Right: my triangulator-sampler, 9 regions.
Left: Ghostty by @mitchellh, 289 regions. Both monitored live with my project 👇
teapaw.org/breakbadsp/status/2117…
Will this be enough for me to get job at @SpaceXSI
github.com/breakbadsp/triang…
23
Will this be enough for me to get job at @SpaceXSI
github.com/breakbadsp/triang…
Sachin retweeted
I'm working on a computer use bench to measure task success and fail rates on various OSs.
Current state: MacOS at the bottom (27% pass rate). Omarchy and t3os at the top (100%).
The Nix fans are NOT gonna be happy about this one...
Sachin retweeted
I always thought it was a shame that modest default stack setups made alloca() a generally-frowned-upon technique in C/C++. With 64 bit architectures, give every stack a virtual address space equal to the physical memory by default!
You can do a surprisingly good job of memory management with just the stack, and I contend that it has both correctness and performance advantages.
Allocations are a trivial pointer adjustment, and frees are literally free. Keeping everything linearly packed is friendlier for all layers of the cache hierarchy, and it makes keeping everything in huge / gigantic pages easy.
Leaving temporary intermediate blocks on the stack can seem wasteful, but unless you are dealing with algorithms that make > O(n) temporary allocations, it is usually not a big deal.
Static analysis can check if you store a stack pointer into a structure deeper in the stack, which is a use-after-free, and then memory management correctness is guaranteed.
The discipline of caller-allocates-return is awkward in some dynamic cases. It would take a change in low level calling conventions, but you could plausibly have functions that return with the stack extended from where it was when they were called. I’m not holding my breath for that.
It isn’t obvious if having AI coding agents makes discussions of software architecture more or less important!
Seems like nobody is using bluetooth keyboard with @omarchy @OmarchyLinux , it does not work to enter password when we reboot the system.
@dhh
13
Bug report @t3dotcodes , T3 code starting same session again if mobile app reconnect
1
97




















