Uniform Data Distribution
Bywise uses its own block architecture, called Uniform Data Distribution (UDD), formed by transactions and slices as shown in the figure. This architecture creates a “super block” composed of the hashes of smaller blocks instead of transactions. These smaller blocks are called slices and carry transaction hashes.
A new mempool is added to the blockchain to contain the slices, which are also pre-validated. Likewise, when propagating a block, the step of validating the slices becomes unnecessary.
This structure is multiplicative, allowing for a much larger number of transactions per block. If Bywise has 1 MB slices and a maximum block of 10 MB, the maximum number of transactions per second is quadratic and returns an absurdly high value of almost 17 million transactions per second.
What allows such high values of transactions per second is the quadratic nature of the stratification of the block associated with the pre-validation of slices and transactions, if these elements were revalidated before the transmission of the block, the propagation would be absurdly slow, generating forks in the network.
Another change made is the limitations of blocks and slices being made in number of transactions and not size in MBs, since fixed-size hashes are stored and not entire transactions/slices.
It is also expected that with slices of 32,768 transactions (1 MB), there would be one or two slices per block at the beginning of the network. This phenomenon can open loopholes for attacks or dishonest practices.
To avoid too few slices in a block, the blocks were divided into regions, each region has a maximum number of transactions per slice, something similar to the epic roadmap of a cryptocurrency, but with slice IDs instead of block IDs in the ledge.