tyushk

Web stacks? Probably.

The single stack allocator seems to be an arena by other terms, but the double headed version is pretty neat.

Is the final pattern described actually safe for multi-threaded use? Something like the stack has exactly 1 byte left, T1 allocates the dynamic end with 1 byte (dynamic object just happened to be 1 byte, say) and T2 allocates the fixed size end with 1 byte. Wouldn't they end up overlapping in that case?

Using it as part of an agentic CAD workflow, where the model needs to be able to selectively segment from parts of a user's image as it works on a project. Using OpenSCAD so being a general purpose model is very useful to me.

Cool to see another model with support for bounding boxes on images. Really wish to see segmentation in a future release; Gemini 3.5 Flash-Lite is mandatory in my use case as it's the best model for semantic image segmentation in my experience.

Victor Taelin's work (HVM) got me interested in interaction combinators as a compilation target. I'm now working on an implementation as part of my Uni research. Cool to see Bend 2.0 release!

Do you have an example? I'm struggling to think of such a case where ! is ambiguous between a end of macro call and the Never type.

Unlike Chrome, Firefox did not remove the older API.

quack3.exe again in a way. If it's been done for years on GPU shaders, then why not CPU code?

Data tagging? 20k tok/s is at the point where I'd consider running an LLM on data from a column of a database, and these <=100 token problems provide the least chance of hallucination or stupidity.

Code blocks unreadable if the user's system reports dark mode and dark mode is toggled on for the web page.

Cool writeup. Have you had to do any other weird shenanigans with getting FFI between Rust and Clojure other than needing to use CStrings?

In Rust, wouldn't implementing BitOr for Fn/FnOnce/FnMut violate the orphan rule?