We can now fix McDonald's ice cream machines
ifixit.com
Bluesky Is Not Decentralized
beige.party
Before you buy a domain name, first check to see if it's haunted
bryanbraun.com
Why those particular integer multiplies?
fgiesen.wordpress.com
How can this 6 axis robot have a static accuracy of 0.05 mm? (2021) [video]
youtube.com
In the US, regenerative farming practices require unlearning past advice
investigatemidwest.org
Mdx – Execute Your Markdown Code Blocks, Now in Go
github.com
Adventures in algorithmic trading on the Runescape Grand Exchange
tristanrhodes.com
Detecting when LLMs are uncertain
thariq.io
Marketing the Odin Programming Language Is Weird
gingerbill.org
Universal optimality of Dijkstra via beyond-worst-case heaps
arxiv.org
A deep dive into Linux's new mseal syscall
blog.trailofbits.com
Toasty, an async ORM for Rust
tokio.rs
The Rise of Giant Pumpkins
saturdayeveningpost.com
OmniParser for Pure Vision Based GUI Agent
microsoft.github.io
Wikipedia article blocked worldwide by Delhi high court
en.wikipedia.org
Astronomers discover complex carbon molecules in interstellar space
sciencealert.com
Company named "><SCRIPT SRC=HTTPS://MJT.XSS.HT> LTD" forced to change it (2020)
theguardian.com
Kronos: Soviet Processor Family for High-Level Languages (2006) [pdf]
inria.hal.science
> PMADDUBSW produces a word result which, in turns out, does not quite work. The problem is that multiplying unsigned by signed bytes means the individual product terms are in range [-128*255, 128*255] = [-32640,32640]. Our result is supposed to be a signed word, which means its value range is [-32768,32767]. If the two individual products are either near the negative or positive end of the possible output range, the sum overflows.
can someone explain this to me? isn't 32640 < 32767? how's this an overflow?