Hey all, I have been thinking a lot about the issue of ordinal spam and growing demand for extending the security of bitcoin to other use cases. It seems the community is split on support for ordinals, and the only way forward is to find a solution which gets rid of the spam while letting people still play with tokens on bitcoin.
To resolve this, I propose L2Ordinals, a zero knowledge proof protocol which rolls up all the 1000s of ordinal transactions flooding the mempool into a single 300 byte proof which is verified by an indexer:
In addition to cutting down on ordinal spam, this solution still provides the same security that standard ordinal based tokens have, while also extending the security model to arbitrary computation (anything you can write in a zk circuit, ex. zkVM):
- All token transfers are PROVED by the ZKP and VERIFIED by the indexer (just as BRC-20 tokens are verified by the indexer)
- Sequenced by Bitcoin
- To compute the current layer 2 network state, all you have to do is startup a bitcoin full node + indexer and playback all the blocks from genesis
- State transitions are verified by the indexer to ensure proper sequencing (ex. enforce end state root of last proof is the start state of next proof)
There are some implementation details left out that you can checkout at:
https://l2o.io/docs/l2o-a/operations/blockIf anyone else wants to help work on the indexer/has any ideas, feel free to shoot me a DM on twitter @cmpeq.
