Simplex can now produce blocks as fast as its leader can build them.
In a global deployment with 50 validators, it sustained 200 blocks per second with 300ms finality.
One block every 5ms.
- This is not only a huge win in performance, it is also IMO a particularly mathematically beautiful resultReplying to @_patrickogradyIt turns out, this trade wasn't necessary. @roberto_bayardo designed a new tree structure that bounds proof size for active state to only **2 hashes** above the optimal structure (a balanced binary Merkle tree):
- On prediction markets with N outcomes, I heard they run a separate YES/NO orderbook for each outcome, and rely on arbitrageurs to "balance" such markets. If this is the case, why? Why are exchanges not doing the implied matching atomically to increase liquidity?
- Replying to @_patrickogradyAnd yes, @andrebeat already refactored our entire consensus implementation: github.com/commonwarexyz/…
- What do we want?? BIGGER BLOCKS. When do we want 'em?? ONCE A SUFFICIENT NUMBER OF VALIDATORS FORWARD US THEIR NOTARIZED ERASURE-ENCODED SHARDS.[PREVIEW] commonware-constantinople * 1MB blocks * ~290ms block time * ~370ms finalization latency * 50 uniform globally distributed validators (1Gbps baseline/symmetric + 2 vCPU/4GB RAM) TPS maxxing (with decent transaction latency) soon™️
