TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Turing Machines on Bitcoin

44 pointsby GBiTover 3 years ago

7 comments

truth_machineover 3 years ago
So it looks like a better title would have been &quot;saving the state of the turing machine on the bitcoin blockchain&quot;, as the claim of Turing completeness[1] seems disingenious - bitcoin script itself has no looping constructs and is decidedly non turing complete. The user has to call the contract as many times as necessary to ensure that Turning machine transitions between states, and the same user checks that the computation terminated.<p>1: The claim is &quot;It is straightforward to adapt the Turing machine contract above to implement any other Turing machines, by simply changing the states, the symbols and transition function. Thus, any Turing machine can be simulated on Bitcoin, conclusively proving Bitcoin is Turing-Complete by definition. QED.&quot;
评论 #28587409 未加载
评论 #28590699 未加载
评论 #28588467 未加载
trompover 3 years ago
With a separate transaction (over 6KB in size in their small example TM) needed for every TM transition, this can get rather expensive in fees. Except when you run it on Bitcoin BSV as they did.
评论 #28587372 未加载
xiphias2over 3 years ago
This is about Bitcoin SV (BSV), not Bitcoin (BTC)
评论 #28586172 未加载
评论 #28586062 未加载
reginoldover 3 years ago
Could someone who likes this article share what they liked about it?<p>I&#x27;m getting the idea that it&#x27;s either 1. A fun proof of principle project 2. entertains more &quot;compute&quot; ideas on blockchains, kinda like Ethereum
评论 #28586310 未加载
nullcover 3 years ago
This post is making fraudulent claims for the purpose of promoting the court adjudicated conman Craig Wright and his scam Bitcoin knockoff, &quot;Bitcoin Satoshi Vision&quot;.<p>Wright isn&#x27;t particularly technically sophisticated and early on he made the error of claiming Bitcoin Script was turing complete on the basis of it having &quot;multiple stacks&quot;. It transparently is not-- for it can only execute a number of operations fixed in advance, and lacks any looping, recursion, or similar and any script using the altstack can be turned into a slightly larger one that doesn&#x27;t. Rather than retracting or recontextualizing the false claim, he&#x27;s since just continued to double down on it, presumably because doing so helps further isolate the victims of his fraud from people who are technically competent.<p>To support these repeated false claims, Wright eventually published “A Proof of Turing Completeness in Bitcoin Script”, which turned out to be almost entirely plagiarized from a 1964 paper by Corrado Böhm, the discovery of which apparently result in Wright being kicked out of CNAM. <a href="https:&#x2F;&#x2F;samwill102244.medium.com&#x2F;anatomy-of-a-fraud-a-deep-dive-into-one-of-craig-wrights-plagiarized-papers-96bc8624fc12" rel="nofollow">https:&#x2F;&#x2F;samwill102244.medium.com&#x2F;anatomy-of-a-fraud-a-deep-d...</a><p>Publications like the one here are intended to confuse the reader about the definition of turing completeness, and are instead just pointing out the same points that were made that turing completeness was unnecessary in the context of Bitcoin ( <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=TGE6jrVmt_I" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=TGE6jrVmt_I</a> &#x2F; <a href="https:&#x2F;&#x2F;cyber.stanford.edu&#x2F;sites&#x2F;default&#x2F;files&#x2F;russelloconnor.pdf" rel="nofollow">https:&#x2F;&#x2F;cyber.stanford.edu&#x2F;sites&#x2F;default&#x2F;files&#x2F;russelloconno...</a> )which had been pointed out by the community back even before Wright ever knew of Bitcoin.<p>The whole matter is doubly absurd because it would be completely trivial to make Bitcoin script actually turing complete and could be done without breaking compatibility with the existing network. But it is generally considered <i>expressly</i> undesirable to do so by technical experts, because it would remove the existing guarantee that the runtime of all scripts can be determined and limited statically and because it wouldn&#x27;t actually increase the utility of the system.<p>Recent court documents have exposed that Wright&#x27;s activities are being funded by an advanced fee fraud scheme where he promises wealthy investors large amounts of &quot;satoshi&#x27;s bitcoins&quot; in exchange for loans. Based on their own reports it appears the the total amounts taken are in the hundreds of millions of dollars now, or even more. This would all mostly just be sad and amusing except for Wright&#x27;s propensity to file lawsuits against people who point out his fraud (such as myself-- he&#x27;s sued me demanding 6 billion dollars in damages!)<p>For more information on the BSV scam and Wright&#x27;s fraudulent claims checkout <a href="https:&#x2F;&#x2F;www.reddit.com&#x2F;r&#x2F;bsvscam&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.reddit.com&#x2F;r&#x2F;bsvscam&#x2F;</a> and <a href="https:&#x2F;&#x2F;bitcoinmagazine.com&#x2F;business&#x2F;op-ed-how-many-wrongs-make-wright" rel="nofollow">https:&#x2F;&#x2F;bitcoinmagazine.com&#x2F;business&#x2F;op-ed-how-many-wrongs-m...</a>
评论 #28588163 未加载
评论 #28590299 未加载
评论 #28588472 未加载
评论 #28588241 未加载
davidcbcover 3 years ago
This is the perfect representative of blockchain technology because it’s a convoluted way to do something that is better done with existing technologies without using a blockchain.
评论 #28590835 未加载
评论 #28585952 未加载
评论 #28585889 未加载
etaioinshrdluover 3 years ago
The loop only has 8 iterations. Doesn’t look particularly turing complete.
评论 #28587433 未加载
评论 #28587465 未加载