mirror of
https://github.com/luxfi/lens.git
synced 2026-10-30 16:21:16 +00:00
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.
45 lines
1.2 KiB
Go
45 lines
1.2 KiB
Go
// Copyright (C) 2025-2026, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package primitives
|
|
|
|
import (
|
|
"encoding/binary"
|
|
|
|
"github.com/zeebo/blake3"
|
|
)
|
|
|
|
// HashPoint returns BLAKE3-32 over a domain-separated tag and the
|
|
// canonical encoding of `p`. Used as a stable identifier for a
|
|
// curve-point in transcript hashing.
|
|
func HashPoint(tag string, p Point) [32]byte {
|
|
h := blake3.New()
|
|
_, _ = h.Write([]byte(tag))
|
|
bytes, _ := p.MarshalBinary()
|
|
var lenBuf [4]byte
|
|
binary.BigEndian.PutUint32(lenBuf[:], uint32(len(bytes)))
|
|
_, _ = h.Write(lenBuf[:])
|
|
_, _ = h.Write(bytes)
|
|
var out [32]byte
|
|
copy(out[:], h.Sum(nil)[:32])
|
|
return out
|
|
}
|
|
|
|
// HashPoints returns BLAKE3-32 over a domain-separated tag and the
|
|
// canonical encoding of every point in `ps`, length-prefixed for
|
|
// unambiguous parsing.
|
|
func HashPoints(tag string, ps ...Point) [32]byte {
|
|
h := blake3.New()
|
|
_, _ = h.Write([]byte(tag))
|
|
for _, p := range ps {
|
|
bytes, _ := p.MarshalBinary()
|
|
var lenBuf [4]byte
|
|
binary.BigEndian.PutUint32(lenBuf[:], uint32(len(bytes)))
|
|
_, _ = h.Write(lenBuf[:])
|
|
_, _ = h.Write(bytes)
|
|
}
|
|
var out [32]byte
|
|
copy(out[:], h.Sum(nil)[:32])
|
|
return out
|
|
}
|