Skip to main content

Documentation

Getting Started

Architecture

Consensus

Consensus Introduction

Decentralized consensus algorithms require Sybil resistance, using a resource that is both crypto...

Proof of Space

A Proof of Space protocol is one in which: A Verifier can send a challenge to a Prover. The P...

Proof of Time

A Verifiable Delay Function, also referred to as a Proof of Time or VDF, is a proof that a sequen...

Challenges

The BPX consensus algorithm relies on timelords running VDFs for periods of time called sub-slots...

Signage and Infusion Points

Each sub-slot in both the challenge chain and the reward chain is divided into 64 smaller VDFs. B...

Harvesting

Approximately every 9.375 seconds, the beacon client sends a new signage point to the farmer, who...

Multiple Blocks

As you can see, multiple blocks can get infused into the same sub-slot. BPX targets one beacon ...

VDF chains

If we only used one VDF (for the reward chain), the inclusion or exclusion of blocks would allow ...

Overflow Blocks and Weight

For a farmer to create a block, their required_iterations must be less than sub-slot_iterations /...

Foliage

In the previous diagrams, there is no place for farmers to specify their rewards, since all block...

Epoch and Difficulty

Sub-epoch: Sub-epoch N starts when sub-epoch N-1 ends (except for 0th sub-epoch), and it ends at ...

Block Validation

Block validation in BPX is composed of two parts: header validation and body validation. The hea...

Block Creation

As soon as the Execution Client receives a new execution block, it starts working on a candidate ...

Timelord algorithm

A timelord keeps track of the current peak of beacon chain, which includes an infused block at a ...

Analysis

Safety​ The safety of BPX consensus is similar to that of other Nakamoto consensus algorithms li...