Compact Sparse Merkle Trees – Build efficient Blockchains in Elixir

Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…

The scalable blockchain database.

Peer-to-peer hypermedia protocol for Blockchain powered web

The easiest way to build your own BTC trading algorithms.

Decentralized websites using Bitcoin cryptography

For the past few months, I’ve been working on a new Layer 1 blockchain designed to solve what I see as the fundamental trilemma in the space: achieving strong privacy, infinite scalability, and post-quantum security simultaneously. The result is NERV: a private-by-default, horizontally scalable blockchain that replaces Merkle trees with 512-byte neural state embeddings, proven inside Halo2 circuits and attested in hardware enclaves. Key technical innovations: Neural State Embeddings Instead of Merkle trees, the entire state of a shard is compressed into a 512-byte vector using a transformer…