mirror of
https://github.com/luxfi/lens.git
synced 2026-10-30 16:21:16 +00:00
zeekay
2c63fd34fc
Lens is the curve-based threshold signing kernel for Lux. It is the classical analogue of Pulsar (the lattice kernel at github.com/luxfi/pulsar). Both kernels share the same lifecycle shape — Bootstrap → Reshare* → Reanchor — and the same activation circuit-breaker contract. They differ only in the math field: Pulsar over R_q (Module-LWE), Lens over a prime-order curve group (discrete log). Curves shipped: Ed25519, secp256k1, Ristretto255. Each has a deterministically-derived secondary Pedersen generator H from a Lens-specific nothing-up-my-sleeve tag. Sign math: FROST 2-round Schnorr threshold signing per RFC 9591 (Komlo-Goldberg 2020). Verifier checks z·G ?= R + c·X under the unchanged group public key. Reshare math: HJKY97 zero-poly Refresh + Desmedt-Jajodia ReshareToNewSet over the curve scalar field. Master secret s is preserved; only the share distribution rotates per epoch. Activation cert message format: QUASAR-LENS-ACTIVATE-v1, byte-equivalent shape to QUASAR-PULSAR-ACTIVATE-v1. Hash suite: HashSuite interface with Lens-SHA3 (production, cSHAKE256 / KMAC256 / TupleHash256) and Lens-BLAKE3 (legacy) profiles. DKG: distributed FROST DKG with Feldman commitments. No trusted dealer required at genesis if the chain prefers proper distributed DKG. KAT oracles: cmd/reshare_oracle and cmd/dkg_oracle emit deterministic JSON vectors for cross-language byte-equality validation against a future luxcpp/crypto/lens/ port. Tests: full unit + integration coverage on every shipped curve. 60 unique tests, 0 failures.
52 lines
1.3 KiB
Go
52 lines
1.3 KiB
Go
// Copyright (C) 2025-2026, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package reshare
|
|
|
|
import (
|
|
"bytes"
|
|
"crypto/rand"
|
|
"testing"
|
|
|
|
"github.com/luxfi/lens/primitives"
|
|
)
|
|
|
|
// TestKDFOutputDistinguishesTags — same kex + different tags produce
|
|
// different outputs.
|
|
func TestKDFOutputDistinguishesTags(t *testing.T) {
|
|
a := KDFOutput(nil, "tagA", []byte("kex"), []byte("c"), []byte("g"), 0, 0, 0, 1, 32)
|
|
b := KDFOutput(nil, "tagB", []byte("kex"), []byte("c"), []byte("g"), 0, 0, 0, 1, 32)
|
|
if bytes.Equal(a, b) {
|
|
t.Fatal("KDFOutput with different tags collided")
|
|
}
|
|
}
|
|
|
|
// TestCanonicalPair — order-invariant mapping.
|
|
func TestCanonicalPair(t *testing.T) {
|
|
if got := CanonicalPair(3, 5); got != [2]int{3, 5} {
|
|
t.Errorf("CanonicalPair(3,5) = %v", got)
|
|
}
|
|
if got := CanonicalPair(5, 3); got != [2]int{3, 5} {
|
|
t.Errorf("CanonicalPair(5,3) = %v", got)
|
|
}
|
|
if got := CanonicalPair(3, 3); got != [2]int{3, 3} {
|
|
t.Errorf("CanonicalPair(3,3) = %v", got)
|
|
}
|
|
}
|
|
|
|
// TestEraseScalar — scalar zeroed in place.
|
|
func TestEraseScalar(t *testing.T) {
|
|
c := primitives.NewEd25519()
|
|
s, err := c.SampleScalar(rand.Reader)
|
|
if err != nil {
|
|
t.Fatalf("SampleScalar: %v", err)
|
|
}
|
|
if s.IsZero() {
|
|
t.Fatal("sampled zero")
|
|
}
|
|
EraseScalar(s)
|
|
if !s.IsZero() {
|
|
t.Fatal("EraseScalar did not zero scalar")
|
|
}
|
|
}
|