lunatic VS substrate

This reminds me of Lunatic [1], an Erlang-inspired runtime for WebAssembly. Unfortunately it seems like development stalled some months ago.

[1] https://lunatic.solutions/

you can check out https://github.com/lunatic-solutions/lunatic for that

Very cool, and the approach demonstrated might be of interest to a similar problem we have in Ambient (our WASM game runtime that has competing processes that may need to retry interactions.)

That being said - what’s the relation to Lunatic [0]? Are you still working on Lunatic? Is this a side project? Or is it something completely separate?

[0]: https://lunatic.solutions/

Curious too. I follow Lunatic [0] as a candidate for future use, and also wasmCloud [1].

[0] https://lunatic.solutions/

[1] https://wasmcloud.com

Check out Lunatic https://lunatic.solutions/

There's a couple of Rust libs and frameworks inspired on Erlang in 'best of both worlds' attempts, such as https://lunatic.solutions

I found others like Lunatic before, but cannot remember right now.

There is a really good initiative called Lunatic : https://lunatic.solutions/

Substrate — a framework for building application-specific blockchains (written in Rust);

frame-benchmarking = { version = "4.0.0-dev", default-features = false, optional = true, git = "https://github.com/paritytech/substrate.git", branch = "polkadot-v1.0.0" }

To offer some perspective outside of the typical "all crypto is a scam", Parity is doing some cool stuff with a rust modular blockchain library called Substrate https://github.com/paritytech/substrate.

Rust takes the cake in the blockchain space: Substrate, Cosmos (CosmWasm), and Solana. All of the zero knowledge cryptography libraries used for layer 2 solutions are written in Rust, compiling to Wasm (see arkworks, Risc0). Ethereum's next version of smart contracts will even use a restricted subset of Wasm ("Ewasm") instead of EVM.

Verifying NPoS election solution graph and its score is a memory-intensive operation that needs to be performed within a single block time. Under the current runtime constraints, a solution graph with 22,500 nominators can be verified well within the block production time on Polkadot. There are plans to improve on this and implement multi-block election solution verification, after which, the NPoS system can scale to incorporate more nominators.

Fast-unstake is now available on Kusama. This allows instant unstaking if you have not participated in staking in the last 28 eras. https://github.com/paritytech/substrate/pull/12129

First, any outstanding multisig calls (ones where one signatory has signed, but not the threshold) will not be able to execute. Please either finish your multisig calls before this upgrade, or wait until after it is completed. https://github.com/paritytech/substrate/pull/12072

Github: https://github.com/paritytech/substrate