- Naman Garg·Last edited by Naman Garg on Aug 10, 2023Linked with GitHubContributed by
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.EPF Week 1
Another week full of learnings. I realized that I narrowed myself to a single topic too soon, rather I should explore other project topics as well and understand ethereum protocol as a whole.
RnD
- Go ethereum - referred to the book and video
- Learnt Go basics through YT
- Verkle tree - what are verkle trees and jsing notes
- EIP 4488 specs
- Poseidon hash function
- Single slot finality (in early stage so droped but its interesting)
- Danksharding
Next
- Verkle trees
- SSLE
- Ephemeral testnet
- ERC 4337 tooling
Read more
Bullshark
BullShark is a protocol that achieves Byzantine Atomic Broadcast (BAB) in a distributed system using a DAG. It lies in the DAG-Rider paradigm, optimized for the common synchronous case, and entails several main enhancements to ensure practical deployability. The core idea is to use the DAG to order transactions in a distributed Byzantine setting, and it gives a sound solution toward distributed consensus for deploying blockchain technologies. BullShark runs on a peer-to-peer message-passing model, where each message is a vertex in the DAG. The key primitive assumes a computationally bounded adversary who is allowed to corrupt at most a third of the parties. The notion of reliable link between honest parties means that all messages eventually arrive, which is what supports the operation of the protocol both in synchronous and asynchronous periods. The work adopts a GST model to be able to reason about synchronous network conditions. BullShark Core: DAG Constructions The protocol has a DAG construction at its core. Each party posts transaction proposals through messages into a DAG. In the DAG, vertices represent messages, and edges represent causal relationships. The parties make a new vertex through combining blocks of transactions and with references to messages which it has previously received. These references are either strong, hence link to vertices in the previous round, or weak, hence link to vertices in rounds which are earlier to ensure their eventual inclusion in the total order. BullShark relies on reliable broadcast mechanisms to give firm guarantees of message integrity, agreement, and validity among parties with the fact that all honest parties will eventually receive the same messages and have a consistent view of the DAG. The protocol further makes use of a global perfect coin for leader election and is charged with leaders who possess fairness and unpredictability in terms of leadership selections for message proposals. Advancing rounds in BullShark The protocol is built itself around certain conditions that drive the process of advancement. By feeding a round with enough vertices, specifically 2 f + 1, parties ensure advancement into the next. Advancing is guaranteed even when messages in the middle of the process of reaching another party are delayed. During synchronous periods, BullShark introduces timeouts to bound the round advancement protocol, and this dual approach gives the best of both worlds: very low latency and high throughput yet with liveness guarantee under worst-case asynchronous conditions
May 26, 2024Mining Pool
https://github.com/kingstone888/hypepool
Apr 19, 2024Consensus
https://www.paradigm.xyz/2022/07/consensus-throughput
Mar 18, 2024Solo Home Staking
Finally my long left dream was to
Feb 21, 2024
HackMD