I don't mean to alarm anyone but someone just wrote a sha256 function for bitvm:
https://techmix.github.io/tapleaf-circuits/
I think this means we can validate merkle proofs now...which means we can also do 2WP sidechains now
π±π±π±π±
this increases the size of the largest program written for bitvm from ~300 logic gates to ~165,000 logic gates
btw I am still hoping someone will implement a gameboy for bitvm
a gameboy's processor only has ~3000 logic gates
and doom runs on gameboy
Amazing news. Do you have a clear concept yet of how that translates to applications like 2WPs yet, given that bitvm is currently a challenge response game between 2 participants, or are there still some gaps to fill in?
Here's Paul Sztorc's response from telegram:
Paul Sztorc (beware impostor accounts):
Yeah but this only applies to the people who have sat down with each other when the chain started
New people can't join -- or if they do they are trusting the other original people
Also doesn't solve the lopsided fee problem
And, as always, 51% hash can steal via censorship -- but no strength in numbers effect for BitVM 2wp
So I doubt people will use BitVM for 2wp
I would be deeply grateful if someone would explain the significance of this advance in a way that an interested and intelligent bystander might be able to begin to understand?ππ
Yes it works for me but it takes like 5 minutes
It's a very big program and I can't believe my VM implementation can even handle it
(I don't think it would be able to handle a proper dispute)
Here's Paul Sztorc's response from telegram:
Paul Sztorc (beware impostor accounts):
Yeah but this only applies to the people who have sat down with each other when the chain started
New people can't join -- or if they do they are trusting the other original people
Also doesn't solve the lopsided fee problem
And, as always, 51% hash can steal via censorship -- but no strength in numbers effect for BitVM 2wp
So I doubt people will use BitVM for 2wp