Each epoch in BSC consists of multiple slots, and a batch of validators take turns in a predefined order to obtain priority block-producing rights for each slot. This BEP proposes an adjustment to the allocation of priority block-producing rights: each validator receives priority block-producing rights for a predetermined number of consecutive slots per round.
BEP-234 describes a new allocation method for priority block-producing rights, which is logically concise and significantly enhances the system’s transaction processing capacity, while remaining orthogonal to transaction processing optimization techniques within blocks.
The BSC ecosystem is active and continuously evolving, requiring ongoing improvements to the system’s transaction processing capacity.
Currently, each validator obtains priority block-producing rights for a single slot and is then rotated, with a fixed block interval of t. The transaction processing limit is t/2 for validating transactions from the previous block and t/2 for processing transactions in the new block.
Each epoch predefines a set of validators, with a total of validatorN validators, and each validator within the set has a unique index ranging from [0, validatorNum). If the current block height is blockN, then the validator with the following index obtains priority block-producing rights.
Every epoch will select a new set of validators, assuming an epoch contains epochSlots slots. Block producer rotation will only occur when the block height reaches Bswitch to prevent epoch block forgery. The calculation for Bswitch is as follows:
To prevent fewer than 1/2 of the nodes from controlling the entire network, block producers are required to produce fewer than n blocks within the previous validatorN*n/2 historical blocks.
This BEP relies on BSC’s Fast Finality feature. If Fast Finality fails, it may result in the following issues:
- Hidden block attacks: Validators with multiple consecutive slot priority block-producing rights can hide their blocks and release them together to cause longer chain rollbacks.
- Variable transaction finality probabilities: Previously, it required waiting for 2/3*validatorN+ blocks, but with the implementation of this BEP, it requires waiting for 2/3*validatorN*n+ blocks.
Within a single epoch, tail validators have fewer block-producing opportunities, but the allocation of priority rights is unbiased and cannot be manipulated. Therefore, from a statistical perspective, it is fair.
The content is licensed under CC0.