A 3 kB Windows game saved space by embedding its own virtual machine
For Langjam, Laurent Le Brun built a language, a VM and a shoot ’em up in an executable of roughly 3 kB. The constraint ends up shaping the game design too.
Archive
All stories · page 39
IRZ archive, page 39.
To make a dressmaking game, Dressmaker had to choose what not to simulate
Dressmaker keeps fabric choice, patterns, cutting and assembly, then compresses the repetitive hours. It shows how to translate a craft without reproducing everything.
Search five million artworks by idea, not by name
The Last Museum adds semantic search across collections from thousands of museums. Start with a mood or subject, then return to the institutional source.
The brand tool can come before the brand images
Studio Dial often builds the tool before the outputs. Afghan textiles, cocktail motion and urban growth become rules that can produce an identity.
What happens when an animation frame has thickness?
Wet paper, puzzles and sun printing: in Alèxia Ponce’s work, the physical surface does more than add texture. It becomes a rule for motion.
The font on Apollo panels was designed for routers
Gorton was designed in 1894 for mechanical routers, not screens. More than a century later, open-source revivals are bringing it back to the machines that inspired it.
Why the same Chromium can use 900 MB or 278 MB of RAM depending on the counter
In our test, the same Chromium process tree showed about 899 MiB as summed RSS and 278 MiB as median PSS. memftprt is most useful for explaining why both figures can be true at once.
A 3D scan can look right and still have the wrong geometry
A Gaussian Splat can produce convincing views while hiding a bad surface. Gaussian Sculpting binds rendering back to optimized geometry, at a reported cost of 6 to 18 hours per object in the paper's experiments.
A forest takes ten seconds to draw. The land keeps the last word
Replantio turns a polygon into a species shortlist using EcoCrop, ERA5, SoilGrids, WCVP and GBIF. Its value lies as much in its model as in the boundary it draws between screening and prescription.
Kafka already stores the value. rpkv keeps only its address
rpkv stores only each key's partition and offset, then fetches the value from Kafka. A very young experiment that makes the storage-versus-latency tradeoff unusually visible.