
446 Followers
We have an implementation of the minimal keystore rollup working internally, current timeline is a public testnet in Q2 and mainnet in Q3 after audits.
Thanks, this is useful info. The first prototype we built avoided recursive SNARKs, but we couldn't figure out how to get the onchain costs to a reasonable place, even with batching. Ignoring the single pairing, napkin math was showing the total MSMs per proof adding up to min $5-10 per transaction.
Admittedly we pivoted to recursion pretty early on; would love to hear from anybody who has optimized this.
The ideal end state would be some ability to read L1 state directly on L2s, like Optimism's Remote Static Call proposal or Brecht's L1CALL proposal. It seems it will take some time before we standardize on this.