I'm very excited about the launch of this paper which is part of a project Robin and I have been working on together. Today I hope to launch a demonstration that you can use bitcoin to compute a 64 bit division function.
More details are provided on my github, where I'm also nearly finished with a proof-of-concept implementation of bitvm for bristol circuits:
reply
I've seen you (as in, on YT) code in sublime. And I thought that was impressive.
But this is so next level, I can't even.
To put it another way: I might know someone who knows someone who knows something about bristol circuits, if you catch my drift.
Thanks for the introduction!
reply
How much do I pay for 64b division? 😀
reply
The cost of a single transaction, if the BitVM paper is to believed
reply
well, 2. In the cooperative case there is a "funding" transaction and then a "settlement" transaction. In the dispute case there is also 1 or more "challenge" transactions and 0 or more "response" transactions.
reply
Wow! Sounds awesome! Congrats SuperTesnet!
reply
Interesting, reading it now.
reply
I read it. Although I don't understand everything, I think I prob get the gist of it.
If this becomes very widespread in use, and there need to be made ever more hashes to load these programs into the leaves, will the likely hood of collisions increase? And if so, can this be solved for by simple error-correction? Or maybe my questions doesn't make sense (i'm not very technical with computer stuff ;)
reply
Don't worry, the multiverse will run out of energy before we brute-force-search our way to a sha256 hash collision.
reply
Are you counting Marvel style 9 realms, or infinite multiverse? 😂
Either way congrats to the progress!
reply
Thanks for taking the time. I should've known that.
reply
Multiverse idk but for btc within its hash-horizon, it should suffice.
reply
idk if the question is even relevant.. so.. yeah sry. Trying to grok.
reply
ah! I was wondering how you got your demo out so fast!
reply