mirror of
https://github.com/onsonr/sonr.git
synced 2025-03-10 04:57:08 +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>
100 lines
3.0 KiB
Go
Executable File
100 lines
3.0 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 TestIPPHappyPath(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(8, *curve)
|
|
b := randScalarVec(8, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
proof, err := prover.Prove(a, b, u, transcript)
|
|
require.NoError(t, err)
|
|
require.Equal(t, 3, len(proof.capLs))
|
|
require.Equal(t, 3, len(proof.capRs))
|
|
}
|
|
|
|
func TestIPPMismatchedVectors(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(4, *curve)
|
|
b := randScalarVec(8, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
_, err = prover.Prove(a, b, u, transcript)
|
|
require.Error(t, err)
|
|
}
|
|
|
|
func TestIPPNonPowerOfTwoLengthVectors(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(3, *curve)
|
|
b := randScalarVec(3, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
_, err = prover.Prove(a, b, u, transcript)
|
|
require.Error(t, err)
|
|
}
|
|
|
|
func TestIPPZeroLengthVectors(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(0, *curve)
|
|
b := randScalarVec(0, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
_, err = prover.Prove(a, b, u, transcript)
|
|
require.Error(t, err)
|
|
}
|
|
|
|
func TestIPPGreaterThanMaxLengthVectors(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(16, *curve)
|
|
b := randScalarVec(16, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
_, err = prover.Prove(a, b, u, transcript)
|
|
require.Error(t, err)
|
|
}
|
|
|
|
func TestIPPMarshal(t *testing.T) {
|
|
curve := curves.ED25519()
|
|
prover, err := NewInnerProductProver(8, []byte("test"), *curve)
|
|
require.NoError(t, err)
|
|
a := randScalarVec(8, *curve)
|
|
b := randScalarVec(8, *curve)
|
|
u := curve.Point.Random(crand.Reader)
|
|
transcript := merlin.NewTranscript("test")
|
|
proof, err := prover.Prove(a, b, u, transcript)
|
|
require.NoError(t, err)
|
|
|
|
proofMarshaled := proof.MarshalBinary()
|
|
proofPrime := NewInnerProductProof(curve)
|
|
err = proofPrime.UnmarshalBinary(proofMarshaled)
|
|
require.NoError(t, err)
|
|
require.Zero(t, proof.a.Cmp(proofPrime.a))
|
|
require.Zero(t, proof.b.Cmp(proofPrime.b))
|
|
for i, proofCapLElem := range proof.capLs {
|
|
proofPrimeCapLElem := proofPrime.capLs[i]
|
|
require.True(t, proofCapLElem.Equal(proofPrimeCapLElem))
|
|
proofCapRElem := proof.capRs[i]
|
|
proofPrimeCapRElem := proofPrime.capRs[i]
|
|
require.True(t, proofCapRElem.Equal(proofPrimeCapRElem))
|
|
}
|
|
}
|