The PaLa protocol is known for its simplicity and effectiveness in achieving Byzantine Fault Tolerance (BFT). This thesis discusses the main properties of the PaLa – partially synchronous blockchain protocol, its advantages and disadvantages, and key aspects of its structure. We also compare PaLa with other algorithms, such as Tendermint, Hotstuff, and Casper FFG, which have fewer limitations due to their more complex structure. Based on the considered limitations, the following modifications are presented, which allow to extend them: Pipelet protocol, Committee rotation algorithm, and Streamlet protocol.