Brevis is a highly efficient ZK coprocessor that empowers smart contracts to read from the full historical on-chain data from all supported blockchains and runs customizable computations in a completely trust-free way.
● Mechanism Design for ZK-Rollup Prover Markets（https://arxiv.org/abs/2404.06495）
○ on the economics of prover networks, Livshits co-author
Proof of Backhaul: Trustfree Measurement of Broadband Bandwidth
○ PoB (Proof of Backhaul) ensures how to obtain accurate and reliable bandwidth under the bandwidth incentive mechanism of the decentralized network.
■ Multi-Challenger Mechanism： Multiple challengers simultaneously send traffic to the target node, simulating a high-load network environment, to ensure the accuracy and robustness of bandwidth measurement.
■ Digital Signatures: Each challenger signs the data packets they send to ensure the authenticity and non-repudiation of the challenge traffic.
■ Merkle trees: Mekle trees are used to generate partially verifiable hashes, proving the amount of data received.
○ In our POCD (Proof of client diversity) design, we can also adopt a multi-challenger model to obtain the signature, and then multiple challengers aggregate the signatures（e.g., BLS）, and then use the Verkle tree (More efficient data structures) to verify.
zk coprocessor:
Exploring Correlation Patterns in the Ethereum Validator Network（http://arxiv.org/pdf/2404.02164v1）
● Specular: Towards Secure, Trust-minimized Optimistic Blockchain Execution.
● JOLT: simplest and extensible ZK VM. ○ https://a16zcrypto.com/posts/article/building-jolt/ ○ https://github.com/a16z/jolt ○ written in Rust
● Mechanism Design for ZK-Rollup Prover Markets（https://arxiv.org/abs/2404.06495） ○ on the economics of prover networks, Livshits co-author
Proof of Backhaul: Trustfree Measurement of Broadband Bandwidth ○ PoB (Proof of Backhaul) ensures how to obtain accurate and reliable bandwidth under the bandwidth incentive mechanism of the decentralized network. ■ Multi-Challenger Mechanism： Multiple challengers simultaneously send traffic to the target node, simulating a high-load network environment, to ensure the accuracy and robustness of bandwidth measurement. ■ Digital Signatures: Each challenger signs the data packets they send to ensure the authenticity and non-repudiation of the challenge traffic. ■ Merkle trees: Mekle trees are used to generate partially verifiable hashes, proving the amount of data received. ○ In our POCD (Proof of client diversity) design, we can also adopt a multi-challenger model to obtain the signature, and then multiple challengers aggregate the signatures（e.g., BLS）, and then use the Verkle tree (More efficient data structures) to verify.
● multidimensional gas pricing, by vitalik（https://vitalik.eth.limo/general/2024/05/09/multidim.html）
● Weakly related: the client diversity of the boot nodes. ○ https://ethresear.ch/t/execution-consensus-client-bootnodes/14588/6
a node crawler of ETH2.0 (https://github.com/ChainSafe/nodewatch-api)