substrate-open-working-groups VS grenad

Polkadot Developer Community - Official community forum to discuss Substrate, PolkadotJS, and building cross-chain dApps.

And of course you can always develop your own blockchain with Substrate to support it.

A great framework for building your own blockchain, and use numerous off-the-shelf modules, with Substrate - https://substrate.dev/

If you're interested in developing yourself, check out substrate.dev.

Assuming you are working through the substrate.dev tutorials I have just had this same problem as worked around it by reverting the node template to the `polkadot-v0.9.25` tag.

Well. Polkadot created substrate (substrate.dev) which is a framework for building a blockchain, with a lot of general components to make it easy to "plug-and-play" your customizable blockchain. I tried using their "Getting Started" guide to spin up "my own blockchain", it was done within an hour or so.

Check out https://substrate.dev/ !

Substrate is not a chain; it's the default address style, named after the Substrate development framework which virtually all (if not all) parachains are currently built with. https://substrate.dev/

Do contact the Substrate project (basis of the Polkadot/Kusama project), which is based in Berlin. You can contact them on their channel (see their website on http://substrate.dev), they're friendly and many of them are native German speakers.

I tried new inserting algorithms on the sorter to reduce the amount of time spent sorting but didn’t find anything better than that, would you have any idea? I gave up trying better inserting algorithms by declaring that doing one final in-memory sort was more effective that doing a lot of comparison to try inserting keys in the right order…

I have finalized the latest release of grenad which introduce a lookup struct called a Cursor. Grenad is a library that provides tools to sort, merge, write, and read immutable key-value pairs.

I worked on my grenad library: a library used to sort, merge, write, and read key-value pairs, used in MeiliSearch for the new indexing system. I added a lot of documentation to the crate and done a lot of improvement by reducing the amount of copied memory when merging key-value pairs.

I was wondering if you could maybe point me to any blog post regarding the segment merging? I am using my grenad library, which is a simplification of my MTBL Rust port. This is a key-value store with some useful sorter helping functions, using a merge function, some compression parameters... Works great but could maybe be improved.

I also wanted to develop an immutable key-value store with some interesting properties like compression and multi-database (like for LMDB), it is much easier to develop than LMDB, I just need to base this on something like my grenad lib plus a wrapper to support multi-databases.