Sekalet

As much as I enjoy app development, I love systems design

[Sekalet @XessiveObserver]

@emmanuelao_ @X UI is crisp, one'd think, this is what Apples' liquid glass should have been!

[Sekalet @XessiveObserver]

@QuePayApp Nice!

[Sekalet @XessiveObserver]

Vibe coding is the new tutorial hell

[Sekalet @XessiveObserver]

@shafu0x Makes many of us

[Sekalet @XessiveObserver]

@bolaabanjo Enough said

[Sekalet @XessiveObserver]

@noor36758 Somebody forgot to match the dates to current affairs 😁

[Sekalet @XessiveObserver]

@shafu0x Funny how HR convinces tech people on the panel to either hire you or not

[Sekalet @XessiveObserver]

@farman4x 5

[Sekalet @XessiveObserver]

@pierreeliottlal What a great time to stay locked in on priority

[Sekalet @XessiveObserver]

@0xAX Isn't this what pointers are for

[Sekalet @XessiveObserver]

Welcome to the days of imaginery latest model demand creation only for you to spend more in tokens to build a bucklist apps with zero MMR by end of year

[Sekalet @XessiveObserver]

@Beno10_MFC 5km

[Sekalet @XessiveObserver]

@ai_for_success His time passed, it won't be him, his contribution pushed the realization of AGI forward, but the promised land ain't his to explore, it is some else's

[Strace @straceX]

PIDs get recycled, pidfds don't.

If you kill() a PID you saved twenty minutes ago, you might be signaling an entirely different process.
a pidfd is a stable handle to that specific process even after PID reuse.

one of those linux features that feels obvious the moment you learn it.

[Sekalet @XessiveObserver]

@chantastic It takes less than 20 minutes to be up and running with any new agentic flow, but fundamentals save a life time

[trish @TrisH0x2A]

the binary search you memorized is probably wrong

Jon Bentley published a binary search in Programming Pearls after proving it correct and testing it

the bug survived for nearly 20 years

Joshua Bloch later discovered the exact same bug in the binary search implementation he wrote for the JDK

a 1988 study found correct binary search in only 5 of 20 textbooks

the bug only triggers on arrays with 2^30 or more elements

the problem appears when computing the midpoint

mid = (low + high) / 2 can overflow on very large arrays

the fix is simple: mid = low + (high - low) / 2

in C the overflow gives you an array index out of bounds with unpredictable results in Java it throws ArrayIndexOutOfBoundsException

the same bug affected mergesort and countless other divide and conquer algorithms

[Sekalet @XessiveObserver]

@5FITCEO The most sensible tweet of the year

[Sekalet @XessiveObserver]

@Tech_girlll No, you're cooked

[Sekalet @XessiveObserver]

@Samaytwt None

[Sekalet @XessiveObserver]

@systemdesignone Slop