timezone
Asia/Shanghai

Bill

自我介绍 Hi, my name is Bill. I'm a security researcher focusing on the Ethereum ecosystem.
你认为你会完成本次残酷学习吗？ Yes.

Notes

Verkle tree
- To replace Merkle-Patricia trie because proofs consumes too much bandwidth.
- Branching factor k
  - O(kn) construction time
  - O(log_k(n))
- Trade-off between computational power and bandwidth.
- Proof is called witness.
To replace Merkle-Patricia trie because proofs consumes too much bandwidth.
Branching factor k
- O(kn) construction time
- O(log_k(n))
O(kn) construction time
O(log_k(n))
Trade-off between computational power and bandwidth.
Proof is called witness.
Recursive Length Prefix (RLP)
- Other serialization schemes have a probabilistic nature.
- Inefficient for fixed-length data types like bool and integers.
Other serialization schemes have a probabilistic nature.
Inefficient for fixed-length data types like bool and integers.

After discovering peers through DHT , peers use gossip protocol to disseminate the block throughout the network.
To find different peers.
Using a DHT
- To find different peers.
- After discovering peers through DHT , peers use gossip protocol to disseminate the block throughout the network.
Hunt for Finality