Web3 · hard

43. Simplified Merkle Logic

Pairwise concatenation logic.

Write `step(nodes)` that returns the next level of the tree (half size).

Required in your answer: nodes[i]nodes[i+1]

Runs in a sandboxed worker

function step(nodes) {
  const res = [];
  for (let i = 0; i < nodes.length; i += 2) {
    res.push(nodes[i] + (nodes[i+1] || ''));
  }
  return res;
}

Output appears here.

← 42. Distributed Lock Simulation 44. LRU Cache Implementation →