mirror of
https://github.com/luxfi/crypto.git
synced 2026-07-27 01:54:50 +00:00
Hanzo AI
ecaca10cdb
luxfi/crypto becomes the single Go entry point for ALL Lux-family crypto. Every public function in this module now dispatches between three implementations through a runtime-selectable backend: - vanilla: pure-Go reference (always available) - cgo: native binding (blst, libsecp256k1, ckzg) where present - gpu: batch acceleration via github.com/luxfi/accel The dispatcher reads LUX_CRYPTO_BACKEND (auto|vanilla|cgo|gpu); auto picks the most capable backend the binary was compiled and linked with. New canonical packages: backend/ runtime backend selector (env + programmatic) internal/gpuhost/ accel session lifecycle, single per-process keccak/ Keccak-256 with batch GPU dispatch sha256/ SHA-256 with batch GPU dispatch sha3/ SHA3 / SHAKE family ripemd160/ RIPEMD-160 (Bitcoin/Lux address derivation) ed25519/ Ed25519 with batch GPU verify bn254/ canonical alias for bn256 (matches FIPS naming) modexp/ canonical alias for bigmodexp evm256/ EIP-196/197 precompile ABI wrappers poseidon/ Poseidon2 hash via gnark-crypto pedersen/ Pedersen commitments over BN254 ntt/ Number-Theoretic Transform reference polymul/ negacyclic polynomial multiplication Extended existing packages with batch GPU paths: bls/batch.go BatchVerify routes through accel.BLSVerifyBatch mldsa/batch.go BatchVerify (ML-DSA-65) via accel.DilithiumVerifyBatch mlkem/batch.go BatchEncapsulate / BatchDecapsulate via Kyber kernels secp256k1/batch.go BatchVerifySignature via accel.ECDSAVerifyBatch GPU dispatch is gated on (a) backend.Default(), (b) batch size threshold, and (c) accel.Available(). When any gate fails the call falls through to the vanilla CPU path; output is byte-identical. The legacy gpu/ stub is replaced with a thin probe surface (Available, Backend, Devices, Version) that delegates to the same gpuhost session. Tests show vanilla and gpu backends produce identical outputs across all batch entry points (-race clean). See AUDIT.md for the per-algorithm state matrix and honest gaps.
54 lines
1.1 KiB
Go
54 lines
1.1 KiB
Go
package pedersen
|
|
|
|
import (
|
|
"testing"
|
|
|
|
bn254 "github.com/consensys/gnark-crypto/ecc/bn254"
|
|
"github.com/consensys/gnark-crypto/ecc/bn254/fr"
|
|
)
|
|
|
|
func TestCommitmentHomomorphism(t *testing.T) {
|
|
gens, err := NewGenerators(nil)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
var m1, r1, m2, r2 fr.Element
|
|
m1.SetUint64(7)
|
|
r1.SetUint64(13)
|
|
m2.SetUint64(5)
|
|
r2.SetUint64(11)
|
|
|
|
c1 := gens.Commit(&m1, &r1)
|
|
c2 := gens.Commit(&m2, &r2)
|
|
|
|
// Commit(m1+m2, r1+r2) should equal c1 + c2.
|
|
var mSum, rSum fr.Element
|
|
mSum.Add(&m1, &m2)
|
|
rSum.Add(&r1, &r2)
|
|
cSum := gens.Commit(&mSum, &rSum)
|
|
|
|
var aJ, bJ bn254.G1Jac
|
|
aJ.FromAffine(&c1)
|
|
bJ.FromAffine(&c2)
|
|
aJ.AddAssign(&bJ)
|
|
var got bn254.G1Affine
|
|
got.FromJacobian(&aJ)
|
|
|
|
if !got.Equal(&cSum) {
|
|
t.Errorf("Pedersen homomorphism violated:\ngot=%v\nwant=%v", got, cSum)
|
|
}
|
|
}
|
|
|
|
func TestNewGeneratorsIndependent(t *testing.T) {
|
|
gens, err := NewGenerators(nil)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
var gAff, hAff bn254.G1Affine
|
|
gAff.FromJacobian(&gens.G)
|
|
hAff.FromJacobian(&gens.H)
|
|
if gAff.Equal(&hAff) {
|
|
t.Error("G and H must be independent")
|
|
}
|
|
}
|