How to Choose Its Parents in the Tangle | SpringerLink
Skip to main content
Springer Nature Link
Log in

How to Choose Its Parents in the Tangle

  • Conference paper
  • First Online:
Networked Systems (NETYS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11704))

Included in the following conference series:

Abstract

The Tangle is a data structure mainly used to store transactions in the IOTA cryptocurrency. It has similarities with the blockchain structure of Bitcoin but in the Tangle, a block contains only one transaction and has not one, but two parents. The security and the stability of this distributed data structure is highly dependent on the algorithm used to select the parents of a new block.

Previous work showed that the current parents selection algorithms are insecure, not stable or have low performances. And we propose a new algorithm that combines all these properties.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    A third one is briefly presented but is actually just a variation of the MCMC that we present here.

  2. 2.

    Observe here that the computational power used by the honest agents is not the same as the computational power of the honest agent. Indeed, the former could be much lower than the latter.

  3. 3.

    This can easily be generalized to the case where each site has k parents, by dividing by k instead of 2 in Eq. (1).

References

  1. Bramas, Q.: The Stability and the Security of the Tangle. Working paper or preprint, April 2018. https://hal.archives-ouvertes.fr/hal-01716111

  2. Gal, A.: Algorithm for calculating cumulative weight (2018). https://github.com/alongalky/iota-docs/blob/master/cumulative.md

  3. Popov, S.: The Tangle. White paper (2016). https://iota.org/IOTA_Whitepaper.pdf

Download references

Author information

Authors and Affiliations

  1. ENS Rennes, Rennes, France

    Vidal Attias

  2. ICUBE, Strasbourg University, CNRS, Strasbourg, France

    Quentin Bramas

Authors
  1. Vidal Attias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quentin Bramas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Quentin Bramas .

Editor information

Editors and Affiliations

  1. Uppsala University, Uppsala, Uppsala Län, Sweden

    Mohamed Faouzi Atig

  2. Augusta University, Augusta, GA, USA

    Alexander A. Schwarzmann

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Attias, V., Bramas, Q. (2019). How to Choose Its Parents in the Tangle. In: Atig, M., Schwarzmann, A. (eds) Networked Systems. NETYS 2019. Lecture Notes in Computer Science(), vol 11704. Springer, Cham. https://doi.org/10.1007/978-3-030-31277-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31277-0_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31276-3

  • Online ISBN: 978-3-030-31277-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics