I said k^n (simplified to 2^n), not k*n. The size of the in-script interpreter grows exponentially with the size of the longest script it can interpret. But I already think I jumped the gun here :x it'd be (2^k * n) for k ops which indeed is O(n)
Post by twetch#2782
- for N ops
I need to slow down
What the chain says
- Block
- 658 161
- Time
- 2020-10-23T19:30:46Z
- Signer
- 1486QpNpWYjokSfc3DxChCQG6gS2cTvVpL
- App
- twetch
- Type
- post
- Content type
- text/plain
- Name in tx
- twetch#2782
Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.
Signed by
1486QpNpWYjokSfc3DxChCQG6gS2cTvVpL VerifiedReplies (2)
Anyway I'll send you 10 BSV anyway if you promise to give a thorough review/analysis of this short upcoming paper
Man proving a negative is hard and not even a good goal usually