IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0227531.html
   My bibliography  Save this article

Framework and algorithms for identifying honest blocks in blockchain

Author

Listed:
  • Xu Wang
  • Guohua Gan
  • Ling-Yun Wu

Abstract

Blockchain technology gains more and more attention in the past decades and has been applied in many areas. The main bottleneck for the development and application of blockchain is its limited scalability. Blockchain with directed acyclic graph structure (BlockDAG) is proposed in order to alleviate the scalability problem. One of the key technical problems in BlockDAG is the identification of honest blocks which are very important for establishing a stable and invulnerable total order of all the blocks. The stability and security of BlockDAG largely depends on the precision of honest block identification. This paper presents a novel universal framework based on graph theory, called MaxCord, for identifying the honest blocks in BlockDAG. By introducing the concept of discord, the honest block identification is modelled as a generalized maximum independent set problem. Several algorithms are developed, including exact, greedy and iterative filtering algorithms. The extensive comparisons between proposed algorithms and the existing method were conducted on the simulated BlockDAG data to show that the proposed iterative filtering algorithm identifies the honest blocks both efficiently and effectively. The proposed MaxCord framework and algorithms can set the solid foundation for the BlockDAG technology.

Suggested Citation

  • Xu Wang & Guohua Gan & Ling-Yun Wu, 2020. "Framework and algorithms for identifying honest blocks in blockchain," PLOS ONE, Public Library of Science, vol. 15(1), pages 1-14, January.
    • Handle: RePEc:plo:pone00:0227531
    DOI: 10.1371/journal.pone.0227531
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0227531
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0227531&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0227531?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Thomas A. Feo & Mauricio G. C. Resende & Stuart H. Smith, 1994. "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research, INFORMS, vol. 42(5), pages 860-878, October.
    2. Bruno Biais & Christophe Bisière & Matthieu Bouvard & Catherine Casamatta, 2019. "The Blockchain Folk Theorem," The Review of Financial Studies, Society for Financial Studies, vol. 32(5), pages 1662-1715.
    3. Manuel Laguna & Thomas A. Feo & Hal C. Elrod, 1994. "A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem," Operations Research, INFORMS, vol. 42(4), pages 677-687, August.
    4. Péter L Juhász & József Stéger & Dániel Kondor & Gábor Vattay, 2018. "A Bayesian approach to identify Bitcoin users," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-21, December.
    5. Young Bin Kim & Jurim Lee & Nuri Park & Jaegul Choo & Jong-Hyun Kim & Chang Hun Kim, 2017. "When Bitcoin encounters information in an online forum: Using text mining to analyse user opinions and predict value fluctuation," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-14, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. E. Sandeep Kumar, 2022. "Preserving Privacy in Ethereum Blockchain," Annals of Data Science, Springer, vol. 9(4), pages 675-693, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    3. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
    4. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Sacramento Quintanilla & Francisco Ballestín & Ángeles Pérez, 2020. "Mathematical models to improve the current practice in a Home Healthcare Unit," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 43-74, March.
    7. Serigne Gueye & Philippe Michelon, 2005. "“Miniaturized” Linearizations for Quadratic 0/1 Problems," Annals of Operations Research, Springer, vol. 140(1), pages 235-261, November.
    8. Raúl Martín-Santamaría & Ana D. López-Sánchez & María Luisa Delgado-Jalón & J. Manuel Colmenar, 2021. "An Efficient Algorithm for Crowd Logistics Optimization," Mathematics, MDPI, vol. 9(5), pages 1-19, March.
    9. Salewski, Frank & Bartsch, Thomas, 1994. "A comparison of genetic and greedy randomized algorithms for medium-to-short-term audit-staff scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 356, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. A J Higgins & L A Laredo, 2006. "Improving harvesting and transport planning within a sugar value chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 367-376, April.
    11. Sánchez-Oro, J. & López-Sánchez, A.D. & Hernández-Díaz, A.G. & Duarte, A., 2022. "GRASP with strategic oscillation for the α-neighbor p-center problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 143-158.
    12. Andreas Schirmer, 2000. "Case‐based reasoning and improved adaptive search for project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 201-222, April.
    13. Panos M. Pardalos & Tianbing Qian & Mauricio G.C. Resende, 1998. "A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 399-412, December.
    14. A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna, 2021. "A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 629-642, May.
    15. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.
    16. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    17. Charles Fleurent & Fred Glover, 1999. "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 198-204, May.
    18. Rodrigo Hakim das Neves, 2020. "Bitcoin pricing: impact of attractiveness variables," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 6(1), pages 1-18, December.
    19. Bruno, August & Weber, Paige & Yates, Andrew J., 2023. "Can Bitcoin mining increase renewable electricity capacity?," Resource and Energy Economics, Elsevier, vol. 74(C).
    20. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0227531. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.