mirror of
https://github.com/onsonr/sonr.git
synced 2025-03-10 13:07:09 +00:00
Prad Nukala
807b2e86ec
* feat: add docs and CI workflow for publishing to onsonr.dev * (refactor): Move hway,motr executables to their own repos * feat: simplify devnet and testnet configurations * refactor: update import path for didcrypto package * docs(networks): Add README with project overview, architecture, and community links * refactor: Move network configurations to deploy directory * build: update golang version to 1.23 * refactor: move logger interface to appropriate package * refactor: Move devnet configuration to networks/devnet * chore: improve release process with date variable * (chore): Move Crypto Library * refactor: improve code structure and readability in DID module * feat: integrate Trunk CI checks * ci: optimize CI workflow by removing redundant build jobs --------- Co-authored-by: Darp Alakun <i@prad.nu>
87 lines
2.5 KiB
Go
Executable File
87 lines
2.5 KiB
Go
Executable File
package bulletproof
|
|
|
|
import (
|
|
crand "crypto/rand"
|
|
"testing"
|
|
|
|
"github.com/gtank/merlin"
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"github.com/onsonr/sonr/crypto/core/curves"
|
|
)
|
|
|
|
func TestRangeProverHappyPath(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
n := 256
|
|
prover, err := NewRangeProver(n, []byte("rangeDomain"), []byte("ippDomain"), *curve)
|
|
require.NoError(t, err)
|
|
v := curve.Scalar.Random(crand.Reader)
|
|
gamma := curve.Scalar.Random(crand.Reader)
|
|
g := curve.Point.Random(crand.Reader)
|
|
h := curve.Point.Random(crand.Reader)
|
|
u := curve.Point.Random(crand.Reader)
|
|
proofGenerators := RangeProofGenerators{
|
|
g: g,
|
|
h: h,
|
|
u: u,
|
|
}
|
|
transcript := merlin.NewTranscript("test")
|
|
proof, err := prover.Prove(v, gamma, n, proofGenerators, transcript)
|
|
require.NoError(t, err)
|
|
require.NotNil(t, proof)
|
|
require.Equal(t, 8, len(proof.ipp.capLs))
|
|
require.Equal(t, 8, len(proof.ipp.capRs))
|
|
}
|
|
|
|
func TestGetaL(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
v := curve.Scalar.Random(crand.Reader)
|
|
aL, err := getaL(v, 256, *curve)
|
|
require.NoError(t, err)
|
|
twoN := get2nVector(256, *curve)
|
|
product, err := innerProduct(aL, twoN)
|
|
require.NoError(t, err)
|
|
require.Zero(t, product.Cmp(v))
|
|
}
|
|
|
|
func TestCmove(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
two := curve.Scalar.One().Double()
|
|
four := two.Double()
|
|
out, err := cmoveScalar(two, four, 1, *curve)
|
|
require.NoError(t, err)
|
|
require.Zero(t, out.Cmp(four))
|
|
}
|
|
|
|
func TestRangeProverMarshal(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
n := 256
|
|
prover, err := NewRangeProver(n, []byte("rangeDomain"), []byte("ippDomain"), *curve)
|
|
require.NoError(t, err)
|
|
v := curve.Scalar.Random(crand.Reader)
|
|
gamma := curve.Scalar.Random(crand.Reader)
|
|
g := curve.Point.Random(crand.Reader)
|
|
h := curve.Point.Random(crand.Reader)
|
|
u := curve.Point.Random(crand.Reader)
|
|
proofGenerators := RangeProofGenerators{
|
|
g: g,
|
|
h: h,
|
|
u: u,
|
|
}
|
|
transcript := merlin.NewTranscript("test")
|
|
proof, err := prover.Prove(v, gamma, n, proofGenerators, transcript)
|
|
require.NoError(t, err)
|
|
|
|
proofMarshaled := proof.MarshalBinary()
|
|
proofPrime := NewRangeProof(curve)
|
|
err = proofPrime.UnmarshalBinary(proofMarshaled)
|
|
require.NoError(t, err)
|
|
require.True(t, proof.capA.Equal(proofPrime.capA))
|
|
require.True(t, proof.capS.Equal(proofPrime.capS))
|
|
require.True(t, proof.capT1.Equal(proofPrime.capT1))
|
|
require.True(t, proof.capT2.Equal(proofPrime.capT2))
|
|
require.Zero(t, proof.taux.Cmp(proofPrime.taux))
|
|
require.Zero(t, proof.mu.Cmp(proofPrime.mu))
|
|
require.Zero(t, proof.tHat.Cmp(proofPrime.tHat))
|
|
}
|