The contract can be simplified by dropping most alt stack usage. Here's an example of a more efficient merkle tree validation construction. At the very least, the unlocking bytecode should alternate sibling_node, sibling_side_boolean, sibling_node, sibling_side_boolean, etc.
The contract can be simplified by dropping most alt stack usage. Here's an example of a more efficient merkle tree validation construction. At the very least, the unlocking bytecode should alternate
sibling_node, sibling_side_boolean, sibling_node, sibling_side_boolean, etc.