Viewing profile — eliasdejong

> FWIW I have a potential solution: to show live data in my app I use an SSE stream of OOB swaps. You might be interested in Datastar [1], which is like htmx but centered around Se…

'Crafting Interpreters' is Bob Nystrom's book that teaches you how to build a compiler from scratch. It is an excellent resource and I can highly recommend it. Really light to read…

standby, server is taking some load. should be back up soon

Creator here, For those interested: - ZERO CLIENT-SIDE OR INLINE JAVASCRIPT except Datastar & Datastar attributes - real-time multiplayer powered by CQRS - 45x45 characters chunks …

check info tab on the top

Read your blogpost, I will need a code editor soon so I might have a stab at hacking something together. > but this doesn’t really work in mobile and it messes with the selection I…

CodeMirror is great, but still requires a lot of clientside JavaScript. I wonder if it would be possible to create a code editor in the same style OverType[0], where the editor is …

Checkout DataStar, it's also a hypermedia web framework but it subsumes the functionality of htmx, is faster, more efficient and fits inside 11 KiB. It uses SSE + brotli streaming …

To me this sentiment is silly. Programming was never about the act of writing, but about making the computer do something. Now we can ask computers to helps us write instructions f…

Very cool project! Being able to replay history is huge and makes it possible to look back in time without having to make full copies of the database. This is something that is ver…

Performance of Protobuf is a joke. Why not use a zero copy format so that serialization is free ? For example, my format Lite³ which outperforms Google Flatbuffers by 242x: https:/…

See also, RUM Conjecture: https://www.codementor.io/@arpitbhayani/the-rum-conjecture-1... Conceptually similar to CAP, but with storage trade-offs. The idea is you can only pick 2 …

Really excellent research and well written, congrats. Shows that io_uring really brings extra performance when properly used, and not simply as a drop-in replacement. > With IOPOLL…

The library contains iterator functions that can be used to recursively traverse a message from the root and discover the entire structure. Then every value can be checked for defi…

Imagine if you measured the speed of beer delivery by the rate at which beer cans can be packed/unpacked from truck pallets. But then somebody shows up with a tanker truck and star…

The primary motivations were performance requirements and frustration with schema formats. The ability to mutate serialized data allows for 2 things: 1) Services exchanging message…

No, I have not benchmarked yet against other languages. Rkyv is Rust only. One primary difference is that Rkyv does not support in-place mutation. So any modification of a message …

> A key feature of this code is that it skips CPU cache when copying Are those numbers also measured while skipping the CPU cache?

Yes, any zero-copy format in general will have this advantage because reading a value is essentially just a pointer dereference. Most of the message data can be completely ignored,…

If the new value is equal size or smaller, it will overwrite the old value in-place. If it is larger, then the new value is appended to the buffer and the index structure is update…

The limit is the number of outstanding cache line requests to the memory controller. CPUs have a fixed number of slots for this, around 10-12 usually. Intel calls them LFBs (Line F…

Being schemaless is deliberate design decision as it eliminates the need for managing and building schema files. By not requiring schema, messages are always readable to arbitrary …

> 14 GB/s Yes, those numbers are real but only in very short bursts of strictly sequential reads, sustained speeds will be closer to 8-10 GB/s. And real workloads will be lower tha…

Increasingly the performance limit for modern CPUs is the amount of data you can feed through a single core: basically memcpy() speed. On most x86 cores the limit is around 6 GB/s …