The property 4 of Theorem 1 in [1]} states that the probability of \(n_{l^{r}}\)  being honest is \(p_{h} = h^{2}(1+h-h^{2})\) , where \(h\)  is the ratio of honest user Algos at stake in the network. From Lemma REF , we know that the ratio of honest to malicious user money units increases for the consensus steps involving block validation if the reputation values list is used for evaluation. Therefore, the value of \(p_{h}\)  also increases in such a case. In conclusion, all the 4 properties of Theorem 1 in [1]} uphold even with the proposed modifications in the consensus procedure using the reputation values list.
