## 4 Nazzfast Consensus Mechanism
### Block Creation Cycle
#### 4.4.1 Block Proposal Phase
Their identities are hidden from everyone; they will only appear if they find any forgery in the block. The block forgery can be found by any node of the network as well. The network can punish the block proposer even after the block finalization because validators cannot be dishonest and leave the system due to the extra bonding time commitment to the network [11]. In such a situation, other validators included in the forge block creation cycle would also be punished by the network. #### 4.4.8 New Block Creation Cycle Setting

To start the new block creation cycle, the network would also upgrade and reset the required parameters for the next block creation cycle of the consensus. For example, if selection of the wildcard entry validator and its connection for the next block creation cycle has been completed, the network would increase the block creation cycle number by 1, and if the current block creation cycle number reached 10, then it would update the round number to 2. Similarly, when the block creation cycle number reached 20, the network reset the block creation cycle number and round number to 1 and released a logbook to all nodes. The logbook is a list of all requests' details received by the host of joining/unjoining nodes as validators [11] during the latest 20-block creation cycle. The height number would remain the same for the next block creation cycle if the new block was not created in this cycle. The next block creation cycle will start after the end of the specified time set by the network for this new height phase. ## 5 Experiment and Evaluation

_Experiment Setting:_ The recent study also uses an open (Jackson) queuing network [41] to theoretically analyze the network with a blockchain network. In our paper, we used the simulation environment to analyze the performance of the entire presented system rather than performing mathematical modeling for the conditions. _Simulation Environment:_ For evaluation of our presented consensus, we develop an entire heterogeneous network model [42] because our consensus has a side chain and parallel execution of the election mechanism. We develop a prototype simulation environment in C# to implement the proposed Nazfast consensus. In the implementations, we generated and used a pair of public and private keys for the encryption and decryption process. We implement all the cryptographic algorithms, such as RSA for encryption using a key size of 2048, SHA-256 for hashing output, which is 256 bits long, digital signature for authenticity, Merkle tree root for easy computation, and zero-knowledge proof for validating data. We also apply broadcast delay in our simulation to create a real-time environment. We calculate the propagation delay by using an exponential distribution [43]. The calculation is provided in the Sea Shield paper [11]. _System Configuration:_ The proposed consensus is based on the PoS-PBFT blockchain network. This network can be used by any type of organization, large or small. The application of the presented consensus is not limited to cryptocurrency; it can be used in the health industry [44], internet of things (IoT) [45], media [46], government [47], and so on. Therefore, network nodes can be general-purpose computers and have general configurations; for that reason, we used the lowest system configuration for testing the simulation system. The system configuration that is used for the entire implementation and testing for the Nazfast has the operating system Microsoft Windows 10 having system type x64-based PC with the Intel(R) Core(TM) i7-7700 CPU @ 3.60 GHz, 3600 MHz, four core(s), and eight logical processor(s). The system has 16.0 GB of installed physical memory (RAM) and 7.06 GB of available physical memory, while total virtual memory in the system is 31.4 GB. However, during the entire network system testing process, we used other configurations for obtaining results as well. _Network Size:_ We used a minimum node requirement of 500 and a minimum validator requirement of 90 for the simulation.