You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As mentioned in the CHIP, an O(1) Execution Stack isn't very hard to implement. But maybe a worthwhile research question before we essentially require implementations to think about this: is practically-unlimited "evaluation stack depth" desirable?
Would the protocol actually be made simpler by adding fixed depth limit on OP_IF and OP_NOTIF?
Or maybe evaluation stack manipulation is still so much faster than hash digest iterations that we don't need to care about this problem either way?
I'd love to hear about the worst-case performance of naively-implemented evaluation stacks in various languages and VM implementations.
The text was updated successfully, but these errors were encountered:
As mentioned in the CHIP, an O(1) Execution Stack isn't very hard to implement. But maybe a worthwhile research question before we essentially require implementations to think about this: is practically-unlimited "evaluation stack depth" desirable?
Would the protocol actually be made simpler by adding fixed depth limit on
OP_IF
andOP_NOTIF
?Or maybe evaluation stack manipulation is still so much faster than hash digest iterations that we don't need to care about this problem either way?
I'd love to hear about the worst-case performance of naively-implemented evaluation stacks in various languages and VM implementations.
The text was updated successfully, but these errors were encountered: