A Probabilistic Analysis of the Nxt Forging Algorithm

Serguei Popov · Ledger · 2016

We discuss the forging algorithm of Nxt from a probabilistic point of view, and obtain explicit formulas and estimates for several important quantities, such as the probability that an account generates a block, the length of the longest sequence of consecutive blocks generated by one account, and the probability that one concurrent blockchain wins over an- other one. Also, we discuss some attack vectors related to splitting an account into many smaller ones.

Read the paper · More papers on PaperTik