earonesty

The "changed to build on sparc" diff is pretty huge.... to commit this would require lots of tests on lots of platforms. Harder to push this one. The others are...

And a womb.

this is the protocol reference: https://github.com/fiatjaf/lnurl-rfc/blob/master/lnurl-pay.md pretty easy to spin up some servers that answer the lnurl-pay requests with wallet responses. only downside is that those serves can route payments...

It seems to me that this can be written as the general case of performing an operation with an "already sorted by my key" container as an argument. If all...

Is there a workaround where we can specify the merge base to codecov? This is getting to the point where it's a showstopper on more complex/bigger projects.

In the first round, each user includes a proof of knowledge of secret key (an ecdh sig is fine). This prevents rogue key attacks. But yes, as long as R̂...

I've been puzzling over this. Certainly a 2 round scheme is fine when there are only 2 signers. If you have, for example, a 2 of 4 threshold scheme (a...

1. Double bit size. - During the entire nonce-establishment step (round 1), a curve with double the # of bits is used. Along with an appropriate proof of knowledge, this...

I did read the frost paper, and I think shumy solves the problem more elegantly. it's intuitive to me that a simple random oracle solution to the nonce should exist,...

FYI: We found that it was insecure on multiple levels. Didn't protect against k-sums, and had an issue with multiple signings of the same message. I'm back to pairings on...