I can't find a single reference on them that contains actual details on the computational model because the internet is full of vapid circular search bait, particularly about cryptocurrencies.
The last I checked, the BTC VM disabled most useful opcodes, which meant you couldn't actually make money automatically redeemable for a large number of constraints you would want to impose.
How do you verify 3-SAT? Just plug in the values and check if it evaluates to TRUE? I assume the idea is to pay people to solve NP-hard problems via TX's, which is a kinda neat idea imo.
It's just asking if many 3 term clauses ANDed together are true for a given input set, so you'd give the inputs to spend it to your wallet. Automatic bounties on optimization (sub)problems, yep.
For various reasons, you probably want to use arithmetic and string operations for encoding certain problens. You could do it in bit operations, but efficiency.
I can't take credit for it -- it's one of those things that was floating around as a usage early on, but the features were killed.
Which features? Looks like (arithmetic, not bitwise) AND/OR/NOT are supported, I'm not an expert but it seems like this could be do-able. I'll have to think about this more maybe I'm missing something.
I can't find a single reference on them that contains actual details on the computational model because the internet is full of vapid circular search bait, particularly about cryptocurrencies.
The last I checked, the BTC VM disabled most useful opcodes, which meant you couldn't actually make money automatically redeemable for a large number of constraints you would want to impose.
My quick search seems to support that the VM still disables many opcodes: https://en.bitcoin.it/wiki/Script