A Probabilistic Analysis of the Nxt Forging Algorithm

  • Serguei Popov University of Campinas
DOI: https://doi.org/10.5195/ledger.2016.46

Abstract

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. 

Author Biography

Serguei Popov, University of Campinas
Full professor at Department of Statistics, www.ime.unicamp.br

References

Andruiman. “Nxt forging algorithm: simulating approach.” (2014) https://scribd.com/doc/243341106/Nxt-forging-algorithm-simulating-approach

Andruiman. “PoS forging algorithms: formal approach and multibranch forging.” (2014) https://scribd.com/ doc/248208963/Multibranch-forging

Andruiman. “Multibranch forging algorithms: tails-switching effect and chain measures.” (2015) https://scribd.com/doc/256073121/Multibranch-forging-algorithms-tails-switching-effect-and-chain-measures

Andruiman. “PoS forging algorithms: multi-strategy forging and related security issues.” (2015) https://scribd.com/doc/256072839/PoS-forging-algorithms-multi-strategy-forging-and-related-security-issues

Athreya, K.B., Ney. P.E. Branching Processes. Berlin–Heidelberg–New York: Springer-Verlag (1972).

Gordon, L., Schilling, M.F., Waterman, M.S. “An extreme value theory for long head runs.” Probab. Theory Relat. Fields 72, 279–287 (1986).

MTHCL. “The math of Nxt forging.” (2014) www.docdroid.net/ecmz/forging0-5-2.pdf.html

Ross, S. M. A First Course in Probability, 8th ed. (2009).

Ross, S. M. Introduction to Probability Models. 10th ed. (2012).

Schilling, M. “The Longest Run of Heads.” The College Math J., 21 (3), 196–206 (1990).

Ledger: The Inaugural Issue
Published
2016-12-21
How to Cite
Popov, S. (2016). A Probabilistic Analysis of the Nxt Forging Algorithm. Ledger, 1, 69-83. https://doi.org/10.5195/ledger.2016.46
Issue
Vol. 1 (2016)
Section
Research Articles

Copyright (c) 2016 Serguei Popov

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

  1. The Author retains copyright in the Work, where the term “Work” shall include all digital objects that may result in subsequent electronic publication or distribution.
  2. Upon acceptance of the Work, the author shall grant to the Publisher the right of first publication of the Work.
  3. The Author shall grant to the Publisher and its agents the nonexclusive perpetual right and license to publish, archive, and make accessible the Work in whole or in part in all forms of media now or hereafter known under a Creative Commons Attribution 4.0 International License or its equivalent, which, for the avoidance of doubt, allows others to copy, distribute, and transmit the Work under the following conditions:
    1. Attribution—other users must attribute the Work in the manner specified by the author as indicated on the journal Web site;
    with the understanding that the above condition can be waived with permission from the Author and that where the Work or any of its elements is in the public domain under applicable law, that status is in no way affected by the license.
  4. The Author is able to enter into separate, additional contractual arrangements for the nonexclusive distribution of the journal's published version of the Work (e.g., post it to an institutional repository or publish it in a book), as long as there is provided in the document an acknowledgement of its initial publication in this journal.
  5. Authors are permitted and encouraged to post online a prepublication manuscript (but not the Publisher’s final formatted PDF version of the Work) in institutional repositories or on their Websites prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work. Any such posting made before acceptance and publication of the Work shall be updated upon publication to include a reference to the Publisher-assigned DOI (Digital Object Identifier) and a link to the online abstract for the final published Work in the Journal.
  6. Upon Publisher’s request, the Author agrees to furnish promptly to Publisher, at the Author’s own expense, written evidence of the permissions, licenses, and consents for use of third-party material included within the Work, except as determined by Publisher to be covered by the principles of Fair Use.
  7. The Author represents and warrants that:
    1. the Work is the Author’s original work;
    2. the Author has not transferred, and will not transfer, exclusive rights in the Work to any third party;
    3. the Work is not pending review or under consideration by another publisher;
    4. the Work has not previously been published;
    5. the Work contains no misrepresentation or infringement of the Work or property of other authors or third parties; and
    6. the Work contains no libel, invasion of privacy, or other unlawful matter.
  8. The Author agrees to indemnify and hold Publisher harmless from Author’s breach of the representations and warranties contained in Paragraph 6 above, as well as any claim or proceeding relating to Publisher’s use and publication of any content contained in the Work, including third-party content.
  9. The Author agrees to digitally sign the Publisher’s final formatted PDF version of the Work.

Revised 7/16/2018. Revision Description: Removed outdated link.