Well, even with R=8 there is a big problem with the "hidden chain" attack performed by the guy with max balance. Assume, for example, that the richest guy has 5% of the stake, and others less than 1%. Then, even if he forges alone, he'll get sometimes **very** heavy weights (5⁸=390625), one his block will easily overweight a very long blockchain created by all others.

Oh, that's true. I've fixed ticket's score formula with *m * log2 b*. Happily, simulations show the updated formula works better against attacks, so adversarial power IPoS is claimed to be safe against is raised to 1/3(33.33%). I've added you to Acknowledgement section Uploading fixed paper to the Arxiv...

It's

*m* times binary logarithm of

*b*, correct? Then there should be kind of "best splitting strategy" to maximize the forging chances (with logarithms, it's clear that getting the highest possible value of

*m* is the best strategy). It would be interesting to do the calculations... But it is important to observe that if everybody uses some kind of splitting strategy, then this

*l* parameter (the number of blocks you must skip before forging the next one) is essentially unimportant (if you have a lot of small accounts, you won't "feel" this restriction).

Also, do I understand correctly that with this algorithm "small" accounts will never forge? I mean, assume that a rich guy has balance

*B*, and splits it into (say) 10

*R*l* equal accounts. Then, any account that has less than

*B*/(10

*R*l*) has almost no chance to forge?..