Implementaion roadmap

[SebastianElvis]

Problem

We need to dissect the task of implementing ORazor into subtasks, each of which includes the problem statement and the involved code.

Description

Alternatives

Additional context

[SebastianElvis]

To implement ORazor, we need to do the following in order:

• Local test environment (single-node and 4-node)
• Committee sampling
• Message formats: Vote, UniqueAnnounce
• Block states: Certified, Finalised
• Consensus rule: longest-chain -> longest-certified-chain
• Wire protocol: onVote(), onUniqueAnnounce(), onTimer()

[SebastianElvis]

• Local test env: https://github.com/SebastianElvis/docker-btcd
• The local state machine is implemented by struct Server in https://github.com/SebastianElvis/orazor/blob/main/server.go. It should additionally maintain the latest committee and handle the ORazor protocol execution.
• Message formats are implemented in directory https://github.com/SebastianElvis/orazor/tree/main/wire
• Block states are implemented in https://github.com/SebastianElvis/orazor/blob/main/blockchain/chain.go
  • Block is implemented by struct blockNode
  • Longest chain rule is implemented by struct bestChain

[SebastianElvis]

A more detailed version from Jianyu:

1. What has happened so far?

This report describes the implementation goals and procedures for realizing Crystal/ORazor. By now, we have achieved the following goals for the two project:

1. Paper of Crystal/ORazor: We have finished the two protocol design and also have two formal papers.
2. Open-source code: We use btcd open-source code, and want to make as minimum modifications as possible.

2. What is going to happen from now on?

Crystal

The goal of realizing Crystal is to measure the protocol overhead, i.e., quorum certificates. According to the protocol, we aim to make the following modifications.

1. Crypto package: We will use unique signature mechanisms and vrf for committee construction; We first choose some candidates (open-source codes). This one is easy.
2. Block Format: We have to include miners’ public unique key in block header for committee election; We also have to include the vote package in block. Our paper has specific block format descriptions.
3. Block Verifying: We have to slightly changes the block verifying process and the longest chain rule.
4. Vote Message Processing: We have to realize an efficient mechanism to send and collect votes. We also have to map votes with blocks.

We don’t consider incentive mechanism for reward assignments.

ORazor

The goal of realizing Crystal is to measure the protocol overhead, i.e., quorum certificates. According to the protocol, we aim to make the following modifications.

1. Crypto package: Similarly, we will also use some signature mechanisms as Crystal. But we don’t use VRF.
2. Block Format: We have to include miners’ public unique key in block header for committee election; We also have to include the vote package in block. Our paper has specific block format descriptions.
3. Block Verifying: We have to slightly changes the block verifying process and the longest chain rule.
4. Vote Message Processing: We have to realize an efficient mechanism to send and collect votes. We also have to map votes with blocks.
5. Block Finalizing: This part distinguishes ORazor with Crystal.
6. Advanced part: We use some simple techniques like decoupling to boost performance.

We don’t consider incentive mechanism for reward assignments.

3. Implementation