📅 Original date posted:2011-12-30 🗒️ Summary of this message: OP_EVAL in ...

Chris Double [ARCHIVE] /

npub14a0…9rte

2023-06-07 02:53:12

in reply to nevent1q…wtxq

📅 Original date posted:2011-12-30
🗒️ Summary of this message: OP_EVAL in Bitcoin scripting language adds expressive power, allowing for Turing completeness and implementation of SK-calculus using stack operations.
📝 Original message:On Fri, Dec 30, 2011 at 5:42 AM, <roconnor at theorem.ca> wrote:
> Basically OP_DUP lets you duplicate the code on the stack and that is the
> key to looping. I'm pretty sure from here we get get Turing completeness.
> Using the stack operations I expect you can implement the SK-calculus
> given an OP_EVAL that allows arbitrary depth.
>
> OP_EVAL adds dangerously expressive power to the scripting language.

If you look at the archives of the concatenative programming mailing
list [1] you'll see lots of examples of people creating stack
languages with minimal operations that exploit similar functionality
to reduce the required built in operations. The discussion on the list
is mostly about stack based languages where programs can be pushed on
the stack and executed (eg. Joy [2]/Factor/Some Forths).

I don't think the scripting engine in bitcoin has the ability to
concatenate, append or otherwise manipulate scripts on the stack to be
eval'd though does it?

[1] http://tech.groups.yahoo.com/group/concatenative
[2] http://tunes.org/~iepos/joy.html

Chris.
--
http://www.bluishcoder.co.nz

Author Public Key

npub14a04f4pkuhuhu9364mzrdvmrsl7680nwqlmweyaac9ywknzwkmtq429rte

Seen on

wss://relay.nostr.band

Show more details

Published at

2023-06-07 02:53:12

Kind type

1 Short Text Note

Event JSON

{ "id": "ed2546ad4fb87a7b221dbe42ef906ad1543ea7a39ff4b121c7fe16698a395c62", "pubkey": "af5f54d436e5f97e163aaec436b36387fda3be6e07f6ec93bdc148eb4c4eb6d6", "created_at": 1686106392, "kind": 1, "tags": [ [ "e", "9a940b93a02313cdd87199fd3d7a873bc06ba92e835205564dcc696f8e0046db", "", "root" ], [ "e", "7979c4250db244762ea6eb9e602c057986aa1f6c419c52bc49ca379bc5c16b8d", "", "reply" ], [ "p", "ec4a4dbf50f892d8061c301520612ae1f0d68350dff4e3e14707d47419d55206" ] ], "content": "📅 Original date posted:2011-12-30\n🗒️ Summary of this message: OP_EVAL in Bitcoin scripting language adds expressive power, allowing for Turing completeness and implementation of SK-calculus using stack operations.\n📝 Original message:On Fri, Dec 30, 2011 at 5:42 AM, \u003croconnor at theorem.ca\u003e wrote:\n\u003e Basically OP_DUP lets you duplicate the code on the stack and that is the\n\u003e key to looping. I'm pretty sure from here we get get Turing completeness.\n\u003e Using the stack operations I expect you can implement the SK-calculus\n\u003e given an OP_EVAL that allows arbitrary depth.\n\u003e\n\u003e OP_EVAL adds dangerously expressive power to the scripting language.\n\nIf you look at the archives of the concatenative programming mailing\nlist [1] you'll see lots of examples of people creating stack\nlanguages with minimal operations that exploit similar functionality\nto reduce the required built in operations. The discussion on the list\nis mostly about stack based languages where programs can be pushed on\nthe stack and executed (eg. Joy [2]/Factor/Some Forths).\n\nI don't think the scripting engine in bitcoin has the ability to\nconcatenate, append or otherwise manipulate scripts on the stack to be\neval'd though does it?\n\n[1] http://tech.groups.yahoo.com/group/concatenative\n[2] http://tunes.org/~iepos/joy.html\n\nChris.\n-- \nhttp://www.bluishcoder.co.nz", "sig": "465e557be8cfd6075b605e2679489dfa7a78c6aa7d10612ca5d50ecce17ea85363a15615a0cdc7fc8f0e9535652db7b60bca2845321d76e8b33c77ed8970f19a" }