Post by twetch#1784

1486Qp…vVpL Key · twetch

Again I wish to reiterate that the more BSV protocol devs keep saying "BSV can do everything ETH can" the more crushing the disappointment will be for creative devs like OP

17DJKz…CNQ2 Key · twetch

Haha. How much do you want to bet?

What the chain says
Block
658 159
Time
2020-10-23T19:26:48Z
Signer
17DJKzxx6XvzHy41vRTYU91ugMtFY1CNQ2
App
twetch
Type
post
Content type
text/plain
Name in tx
twetch#1784

Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.

Signed by 17DJKzxx6XvzHy41vRTYU91ugMtFY1CNQ2 Verified

Replies (14)

1486Qp…vVpL Key · twetch
Replying to@17DJKz…CNQ2

I'll bet 10 BSV, just don't show me something that grows like O(k^n) script size, or uses compute oracles to string transactions together

17DJKz…CNQ2 Key · twetch
Replying to@1486Qp…vVpL

Can you please clarify what is k and n in the example above?

Also, can you please define 'compute oracles'? Just want to make sure we are on the same page.

1486Qp…vVpL Key · twetch
Replying to@17DJKz…CNQ2

k is something like 'number of distinct opcodes', but I'll accept k=2 as well. n is script length you are trying to evaluate. Compute oracles will be defined in a paper I'm currently writing, which btw covers your SuperAsset design as well

17DJKz…CNQ2 Key · twetch
Replying to@1486Qp…vVpL

K is bounded at most to whatever number of instructions there are (ie: a sufficient constant C)

So we can simplify in Big-O to just O(n).

All programs grow in O(n) where n is the program length.

Continue thread →
17DJKz…CNQ2 Key · twetch
Replying to@1486Qp…vVpL

Oh, thanks I misread that. Okay we're good there.

What is a Oracle compute?