Efficiently sorting Ethereum blockchain

Question

I am trying to sort the whole Ethereum blockchain, trying to loop and sort a large number of data.

I am using the following code to do it:

        var txs = {};

var i = 0;

// Loop over blocks

(function loop () {

setTimeout(function () {

  // Get current block

  var block = web3.eth.getBlock(i, true, (error, block) => {

    // debugger;

    // Loop over transactions in block

    for(var j = 0; j < block.transactions.length; j++) {

      // debugger;

      if(txs[block.transactions[j].to]) {

        txs[block.transactions[j].to].transactions.push(block.transactions[j]);

      } else if (txs[block.transactions[j].to]) {

        txs[block.transactions[j].from].transactions.push(block.transactions[j]);

      } else {

        txs[block.transactions[j].to] = {

          transactions: [block.transactions[j]]

        }

        txs[block.transactions[j].from] = {

          transactions: [block.transactions[j]]

        }

      }

    }

  });

  i++

  if (i < highestBlock) {

    loop();

  }

 }, 50);

})();

Is there an efficient way to do it compared to the method I am trying?

Answer 1

What you are trying to do is a very intensive process. You are trying to create a record of all transactions for every address. Your code seems to have an error at the “else-if” point. You should use the txs[block.transactions[j].from] property and not the txs[block.transactions[j].to]. You could also use a recursive pattern by using setImmediate function or the process.nextTick method and use a Map instead of the Object.