IDEAS home Printed from https://ideas.repec.org/a/igg/jfsa00/v11y2022i2p1-17.html
   My bibliography  Save this article

Efficient Bitcoin Mining Using Genetic Algorithm-Based Proof of Work

Author

Listed:
  • Shikha Mehta

    (Jaypee Institute of Information Technology, India)

  • Shikha Mehta

    (Jaypee Institute of Information Technology, India)

  • Mukta Goyal

    (Jaypee Institute of Information Technology, India)

  • Dinesh Saini

    (Manipal University Jaipur, Jaipur, India)

Abstract

Blockchain requires to validate the block with confirmed transactions from the unconfirmed pool of transactions through Miners. Miners pick up the transactions from the pool of unconfirmed transactions approximately more than 2000 and solve the algorithmic puzzle i.e. also known as proof of work within the limited period of time. To maximize the throughput per second requires optimization of the time period to solve the algorithm puzzle for validating the block. Conventionally, for unconfirmed transactions, miners solve the proof of work using brute force algorithms which consume a lot of electrical energy due to the huge number of computations. To optimize the time for block chain mining, this paper proposes a Genetic algorithm based block mining (GAMB) approach to fetch the transactions from the unconfirmed pool of transactions in order to validate the block within a limited period of time. It is a population based algorithm which attempts to solve the proof of work for multiple transactions in parallel. The performance of GAMB is evaluated for transactions from 1000 to 5000.

Suggested Citation

  • Shikha Mehta & Shikha Mehta & Mukta Goyal & Dinesh Saini, 2022. "Efficient Bitcoin Mining Using Genetic Algorithm-Based Proof of Work," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 11(2), pages 1-17, April.
    • Handle: RePEc:igg:jfsa00:v:11:y:2022:i:2:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJFSA.296593
    Download Restriction: no
    ---><---

    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:igg:jfsa00:v:11:y:2022:i:2:p:1-17. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.