Luke Parker eeca440fa7 Offer a multi-DLEq proof which simply merges challenges for n underlying proofs ... This converts proofs from 2n elements to 1+n. Moves FROST over to it. Additionally, for FROST's binomial nonces, provides a single DLEq proof (2, not 1+2 elements) by proving the discrete log equality of their aggregate (with an appropriate binding factor). This may be split back up depending on later commentary...		2023-01-01 09:16:09 -05:00
..
cryptography	Offer a multi-DLEq proof which simply merges challenges for n underlying proofs	2023-01-01 09:16:09 -05:00
integrations	Correct missing escape sequences	2022-07-22 00:32:18 -04:00
protocol	Initial Tendermint implementation (#145)	2022-12-03 18:38:02 -05:00
Getting Started.md	Add svm-rs dependency to getting started.	2022-10-31 15:50:28 -05:00
Serai.md	Initial Tendermint implementation (#145)	2022-12-03 18:38:02 -05:00