mirror of
https://github.com/luxfi/corona.git
synced 2026-07-27 02:50:34 +00:00
Forked from github.com/luxfi/corona @ d09b2c2. Pulsar inherits the
2-round signing math byte-equal but adds blockchain-grade key
lifecycle and a SHA3-based domain-separated hash profile for
permissionless validator-set rotation.
Inherits from upstream Corona (byte-equal):
- Sign1/Sign2/Combine 2-round signing math
- Lattice ring R_q = Z_q[X]/(X^256+1), q = 0x1000000004A01
- Module-LWE / Module-SIS hardness
- NTT, Discrete-Gaussian Ziggurat, MAC layer
Replaces from upstream:
- Broken Feldman-style DKG (pseudoinverse-recoverable). Replaced
with: (a) one-time foundation MPC ceremony / trusted-dealer
Bootstrap; (b) Pedersen DKG over R_q (research, dkg2/) hiding
under MLWE on B / binding under MSIS on [A | B].
- Trusted-dealer-per-epoch lifecycle (wrong shape for permissionless
rotation). Replaced with Verifiable Secret Resharing (VSR) every
epoch under the persistent group public key.
Key-era lifecycle (KeyEraID / Generation / RollbackFrom):
- KeyEraID bumps only at Reanchor (rare governance event)
- Generation bumps every Refresh / Reshare under the same GroupKey
- RollbackFrom records prior generation reverted from (0 = forward)
- Activation cert (QUASAR-PULSAR-ACTIVATE-v1) gates new generations
under the unchanged GroupKey
Pulsar-SHA3 hash profile (NIST FIPS 202 / SP 800-185):
- Hc: cSHAKE256("PULSAR-HC-v1", transcript) → challenge
- Hu: cSHAKE256("PULSAR-HU-v1", transcript) → XOF stream
- TranscriptHash: TupleHash256("PULSAR-TRANSCRIPT-v1", parts...)
- PRF: KMAC256(key, msg, "PULSAR-PRF-v1")
- MAC: KMAC256(key, msg, "PULSAR-MAC-v1")
- Pairwise: KMAC256(kex, encode(...), "PULSAR-PAIRWISE-v1")
- Default suite is Pulsar-SHA3; Pulsar-BLAKE3 retained as optional
non-normative fast profile. HashSuiteID is bound into transcripts.
- Implementation at pulsar/hash/ with HashSuite interface.
- All KATs regenerated under SHA3 profile; vectors in
luxcpp/crypto/pulsar/test/kat/.
Nebula root binding (TranscriptInputs + ActivationMessage canonical
bytes, all bound under TupleHash256):
chain_id, network_id, group_id,
key_era_id, old_generation, new_generation,
old_epoch_id, new_epoch_id,
old_set_hash, new_set_hash,
threshold_old, threshold_new,
group_public_key_hash,
nebula_root,
hash_suite_id,
implementation_version,
variant.
Packages:
primitives/ Shamir over R_q, Lagrange, hash helpers
sign/ 2-round sign math (byte-equal upstream)
threshold/ GroupKey, KeyShare, Signer types
reshare/ VSR kernel — Refresh (HJKY97 zero-poly), Reshare
(Desmedt-Jajodia), commit (Pedersen R_q), complaint,
transcript, pairwise KEX, activation cert
hash/ HashSuite interface; PulsarSHA3 (default), PulsarBLAKE3
dkg2/ Pedersen DKG over R_q (research, reference only)
keyera/ Lifecycle wrapper: Bootstrap → Reshare → Reanchor
papers/ LP-073-pulsar paper (sections + bibliography)
cmd/*_oracle/ KAT generators (Go ↔ C++ byte-equal validation)
DESIGN.md is the single source of truth:
- The Pulsar metaphor (rotating beam over persistent body)
- Vocabulary stack per LP-105: Nebula / Photon / Lumen / Beam /
Pulsar / Pulse / Prism / Horizon / Quasar
- Pulsar ≠ Lumen (PQ stream is separate, planned)
- Pulsar / Lens / LSS three-layer architecture
- Bootstrap Dealer vs Signature Coordinator
- No-slashing failure ladder (timeout → retry → rollback → reanchor)
- MVP VSR vs Robust VSR phasing
- Borrowed-brand terms ("X-Wing" used casually) replaced with
"hybrid KEM" / "Hybrid Lumen Handshake"; X-Wing cited only as
the IETF combiner primitive name where exact reference matters.
Tests: full suite green
hash 5+/5+, keyera 5/5, reshare 45+/45+, threshold, sign, dkg,
dkg2, primitives, networking, utils, corona_oracle_v2 KAT —
all pass.
Honest claim: the crypto primitives are not new (HJKY97,
Desmedt-Jajodia97, Wong-Wang-Wing02, Corona, Hermine, Threshold
Raccoon all exist). The novel contribution is the systems
composition: a permissionless-consensus deployment architecture that
turns static two-round PQ threshold signatures into a dynamic,
leaderless, validator-rotation-tolerant finality layer.
Companion docs: papers/lp-073-pulsar/ (academic paper); LP-073 +
LP-103 + LP-105 in github.com/luxfi/lps; threshold/protocols/lss/
lss_pulsar.go (LSS adapter wrapping this kernel).
316 lines
7.4 KiB
Go
316 lines
7.4 KiB
Go
package networking
|
|
|
|
import (
|
|
"bufio"
|
|
"net"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/luxfi/lattice/v7/ring"
|
|
"github.com/luxfi/lattice/v7/utils/sampling"
|
|
"github.com/luxfi/lattice/v7/utils/structs"
|
|
)
|
|
|
|
func TestP2PComm_EstablishConnections(t *testing.T) {
|
|
// This test requires actual network setup, so we'll test the basic structure
|
|
t.Run("initialization", func(t *testing.T) {
|
|
comm := &P2PComm{
|
|
Rank: 1,
|
|
Socks: make(map[int]*net.Conn),
|
|
}
|
|
|
|
if comm.Rank != 1 {
|
|
t.Errorf("Expected Rank 1, got %d", comm.Rank)
|
|
}
|
|
if len(comm.Socks) != 0 {
|
|
t.Errorf("Expected empty Socks map, got %d connections", len(comm.Socks))
|
|
}
|
|
})
|
|
}
|
|
|
|
func TestP2PComm_SendRecvVector(t *testing.T) {
|
|
// Create a mock connection using a pipe
|
|
server, client := net.Pipe()
|
|
defer server.Close()
|
|
defer client.Close()
|
|
|
|
// Create two P2PComm instances
|
|
comm1 := &P2PComm{
|
|
Rank: 1,
|
|
Socks: map[int]*net.Conn{2: &client},
|
|
}
|
|
|
|
comm2 := &P2PComm{
|
|
Rank: 2,
|
|
Socks: map[int]*net.Conn{1: &server},
|
|
}
|
|
|
|
// Test vector to send - using proper lattice types
|
|
r, _ := ring.NewRing(256, []uint64{8380417})
|
|
prng, _ := sampling.NewPRNG()
|
|
sampler := ring.NewUniformSampler(prng, r)
|
|
testVector := make(structs.Vector[ring.Poly], 3)
|
|
for i := range testVector {
|
|
testVector[i] = sampler.ReadNew()
|
|
}
|
|
|
|
// Send and receive in separate goroutines
|
|
done := make(chan bool)
|
|
var receivedVector structs.Vector[ring.Poly]
|
|
|
|
go func() {
|
|
reader := bufio.NewReader(server)
|
|
receivedVector = comm2.RecvVector(reader, 1, len(testVector))
|
|
done <- true
|
|
}()
|
|
|
|
// Give receiver time to start
|
|
time.Sleep(10 * time.Millisecond)
|
|
|
|
writer := bufio.NewWriter(client)
|
|
comm1.SendVector(writer, 2, testVector)
|
|
writer.Flush()
|
|
|
|
// Wait for receive to complete
|
|
select {
|
|
case <-done:
|
|
// Success
|
|
case <-time.After(1 * time.Second):
|
|
t.Fatal("Timeout waiting for vector receive")
|
|
}
|
|
|
|
// Verify the received vector matches
|
|
if len(receivedVector) != len(testVector) {
|
|
t.Errorf("Received vector length %d, expected %d", len(receivedVector), len(testVector))
|
|
}
|
|
|
|
for i := range testVector {
|
|
if !r.Equal(receivedVector[i], testVector[i]) {
|
|
t.Errorf("Vector mismatch at index %d", i)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestP2PComm_SendRecvMatrix(t *testing.T) {
|
|
// Create a mock connection using a pipe
|
|
server, client := net.Pipe()
|
|
defer server.Close()
|
|
defer client.Close()
|
|
|
|
// Create two P2PComm instances
|
|
comm1 := &P2PComm{
|
|
Rank: 1,
|
|
Socks: map[int]*net.Conn{2: &client},
|
|
}
|
|
|
|
comm2 := &P2PComm{
|
|
Rank: 2,
|
|
Socks: map[int]*net.Conn{1: &server},
|
|
}
|
|
|
|
// Test matrix to send - using proper lattice types
|
|
r, _ := ring.NewRing(256, []uint64{8380417})
|
|
prng, _ := sampling.NewPRNG()
|
|
sampler := ring.NewUniformSampler(prng, r)
|
|
testMatrix := make(structs.Matrix[ring.Poly], 2)
|
|
for i := range testMatrix {
|
|
testMatrix[i] = make(structs.Vector[ring.Poly], 3)
|
|
for j := range testMatrix[i] {
|
|
testMatrix[i][j] = sampler.ReadNew()
|
|
}
|
|
}
|
|
|
|
// Send and receive in separate goroutines
|
|
done := make(chan bool)
|
|
var receivedMatrix structs.Matrix[ring.Poly]
|
|
|
|
go func() {
|
|
reader := bufio.NewReader(server)
|
|
receivedMatrix = comm2.RecvMatrix(reader, 1, len(testMatrix))
|
|
done <- true
|
|
}()
|
|
|
|
// Give receiver time to start
|
|
time.Sleep(10 * time.Millisecond)
|
|
|
|
writer := bufio.NewWriter(client)
|
|
comm1.SendMatrix(writer, 2, testMatrix)
|
|
writer.Flush()
|
|
|
|
// Wait for receive to complete
|
|
select {
|
|
case <-done:
|
|
// Success
|
|
case <-time.After(1 * time.Second):
|
|
t.Fatal("Timeout waiting for matrix receive")
|
|
}
|
|
|
|
// Verify the received matrix matches
|
|
if len(receivedMatrix) != len(testMatrix) {
|
|
t.Errorf("Received matrix rows %d, expected %d", len(receivedMatrix), len(testMatrix))
|
|
}
|
|
|
|
for i := range testMatrix {
|
|
if len(receivedMatrix[i]) != len(testMatrix[i]) {
|
|
t.Errorf("Row %d: received %d columns, expected %d", i, len(receivedMatrix[i]), len(testMatrix[i]))
|
|
}
|
|
for j := range testMatrix[i] {
|
|
if !r.Equal(receivedMatrix[i][j], testMatrix[i][j]) {
|
|
t.Errorf("Matrix mismatch at [%d][%d]", i, j)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestP2PComm_SendRecvBytes(t *testing.T) {
|
|
// Create a mock connection using a pipe
|
|
server, client := net.Pipe()
|
|
defer server.Close()
|
|
defer client.Close()
|
|
|
|
// Create two P2PComm instances
|
|
comm1 := &P2PComm{
|
|
Rank: 1,
|
|
Socks: map[int]*net.Conn{2: &client},
|
|
}
|
|
|
|
comm2 := &P2PComm{
|
|
Rank: 2,
|
|
Socks: map[int]*net.Conn{1: &server},
|
|
}
|
|
|
|
// Test bytes to send - we'll send multiple slices
|
|
testBytesSlices := [][]byte{
|
|
[]byte("test message 1"),
|
|
[]byte("test message 2"),
|
|
[]byte("test message 3"),
|
|
}
|
|
|
|
// Send and receive in separate goroutines
|
|
done := make(chan bool)
|
|
var receivedBytesSlices [][]byte
|
|
|
|
go func() {
|
|
reader := bufio.NewReader(server)
|
|
receivedBytesSlices = comm2.RecvBytesSlice(reader, 1)
|
|
done <- true
|
|
}()
|
|
|
|
// Give receiver time to start
|
|
time.Sleep(10 * time.Millisecond)
|
|
|
|
// Send the bytes slices using SendBytesSlice (matching protocol)
|
|
writer := bufio.NewWriter(client)
|
|
comm1.SendBytesSlice(writer, 2, testBytesSlices)
|
|
writer.Flush()
|
|
|
|
// Wait for receive to complete
|
|
select {
|
|
case <-done:
|
|
// Success
|
|
case <-time.After(1 * time.Second):
|
|
t.Fatal("Timeout waiting for bytes receive")
|
|
}
|
|
|
|
// Verify the received bytes match
|
|
if len(receivedBytesSlices) != len(testBytesSlices) {
|
|
t.Errorf("Received %d slices, expected %d", len(receivedBytesSlices), len(testBytesSlices))
|
|
}
|
|
|
|
for i, slice := range testBytesSlices {
|
|
if i < len(receivedBytesSlices) {
|
|
if string(receivedBytesSlices[i]) != string(slice) {
|
|
t.Errorf("Slice %d: received %s, expected %s", i, string(receivedBytesSlices[i]), string(slice))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestP2PComm_SendRecvBytesMap(t *testing.T) {
|
|
// Create a mock connection using a pipe
|
|
server, client := net.Pipe()
|
|
defer server.Close()
|
|
defer client.Close()
|
|
|
|
// Create two P2PComm instances
|
|
comm1 := &P2PComm{
|
|
Rank: 1,
|
|
Socks: map[int]*net.Conn{2: &client},
|
|
}
|
|
|
|
comm2 := &P2PComm{
|
|
Rank: 2,
|
|
Socks: map[int]*net.Conn{1: &server},
|
|
}
|
|
|
|
// Test bytes map to send
|
|
testBytesMap := map[int][]byte{
|
|
1: []byte("message1"),
|
|
2: []byte("message2"),
|
|
3: []byte("message3"),
|
|
}
|
|
|
|
// Send and receive in separate goroutines
|
|
done := make(chan bool)
|
|
var receivedBytesMap map[int][]byte
|
|
|
|
go func() {
|
|
reader := bufio.NewReader(server)
|
|
receivedBytesMap = comm2.RecvBytesMap(reader, 1)
|
|
done <- true
|
|
}()
|
|
|
|
// Give receiver time to start
|
|
time.Sleep(10 * time.Millisecond)
|
|
|
|
writer := bufio.NewWriter(client)
|
|
comm1.SendBytesMap(writer, 2, testBytesMap)
|
|
writer.Flush()
|
|
|
|
// Wait for receive to complete
|
|
select {
|
|
case <-done:
|
|
// Success
|
|
case <-time.After(1 * time.Second):
|
|
t.Fatal("Timeout waiting for bytes map receive")
|
|
}
|
|
|
|
// Verify the received bytes map matches
|
|
if len(receivedBytesMap) != len(testBytesMap) {
|
|
t.Errorf("Received map size %d, expected %d", len(receivedBytesMap), len(testBytesMap))
|
|
}
|
|
|
|
for k, v := range testBytesMap {
|
|
received, ok := receivedBytesMap[k]
|
|
if !ok {
|
|
t.Errorf("Key %d not found in received map", k)
|
|
continue
|
|
}
|
|
if string(received) != string(v) {
|
|
t.Errorf("Key %d: received %s, expected %s", k, string(received), string(v))
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestP2PComm_Close(t *testing.T) {
|
|
// Create a mock connection
|
|
server, client := net.Pipe()
|
|
defer server.Close()
|
|
|
|
comm := &P2PComm{
|
|
Rank: 1,
|
|
Socks: map[int]*net.Conn{2: &client},
|
|
}
|
|
|
|
// Close connections
|
|
for _, conn := range comm.Socks {
|
|
(*conn).Close()
|
|
}
|
|
|
|
// Verify connections are closed by trying to write
|
|
_, err := client.Write([]byte("test"))
|
|
if err == nil {
|
|
t.Error("Expected error writing to closed connection")
|
|
}
|
|
}
|