It seems the main selling point of micron is speed. You’ve done quite a lot of benchmarking. I think to make the case of micron stronger compared STL it would be cool to publish these benchmarks (where the two are comparable).

Edit: also the simplest way how to do cyclic structures is to heap-allocate via Box and leak memory. Box::leak This is also mentioned in the linked article.

The complications begin with async. Outside of async it’s a beautiful world.

With async, you tend to get locked down on library ecosystem level, with the dominant approach being work-stealing Tokio runtime, which I disagree with the fundamental design, after doing a lot of research. However, the gravity field of Tokio is strong. To escape it , I had to make a copy of popular crates and dig with LLMs to rewrite them to be free of work-stealing.

If you could show how it compares with a simple replicable baseline, maybe something like C program that just accepts a connection? Lots of these things are hardware-dependent.

Right now we use monoio and have a draft benchmark with speed. Happy to continue talking over e-mail. Should I write to you?

It’s not published yet, as it’s a bit wired to our internal systems at the moment. But happy to chat :)

I assume tokio-like, i.e. work-stealing?