In Algorand [1]} the consensus process follows the steps of byzantine agreement while giving the nodes the chance to participate in proportion to the stake they hold in the network.
Algorand blockchain claims to solve the blockchain trilemma of decentralization, security, and scalability [2]}. It provides deterministic block finality, and in terms of block finality time, it has quite significant results among the permissionless blockchains [3]}. The features pertaining to the proposer/validator selection process and data encryption claim the Algorand blockchain to be most resilient against the adversarial attacks on the network among the existing permissionless blockchains. However, it has no inbuilt provision against the users engaged in illicit activities. Therefore, we incorporate and theoretically analyze our method in the Algorand blockchain consensus protocol. As we proceed, we describe our proposed methodology in detail.
