Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

https://github.com/yacovm/ZKAT-VDP
20 March 2024, 19:29:05 UTC
  • Code
  • Branches (1)
  • Releases (0)
  • Visits
    • Branches
    • Releases
    • HEAD
    • refs/heads/main
    No releases to show
  • 48554d7
  • /
  • xicircuit
  • /
  • xicircuit_test.go
Raw File Download
Take a new snapshot of a software origin

If the archived software origin currently browsed is not synchronized with its upstream version (for instance when new commits have been issued), you can explicitly request Software Heritage to take a new snapshot of it.

Use the form below to proceed. Once a request has been submitted and accepted, it will be processed as soon as possible. You can then check its processing state by visiting this dedicated page.
swh spinner

Processing "take a new snapshot" request ...

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
  • revision
  • snapshot
origin badgecontent badge Iframe embedding
swh:1:cnt:7b2fb926735786a72c7a5da96025f6fccc8e352d
origin badgedirectory badge Iframe embedding
swh:1:dir:5084f53e62d1bd2daba0a6488785bf26b743fb78
origin badgerevision badge
swh:1:rev:721f52b1b74f8e0aa60799bd1436865f8020258e
origin badgesnapshot badge
swh:1:snp:979a5772312db4ab61b637ed766bbc6a3f369470

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
  • revision
  • snapshot
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Tip revision: 721f52b1b74f8e0aa60799bd1436865f8020258e authored by yacovm on 14 August 2023, 13:43:45 UTC
Create README.md
Tip revision: 721f52b
xicircuit_test.go
package xicircuit

import (
	"blockchain_DP/hashfunctions"
	crand "crypto/rand"
	"fmt"
	"sort"
	"testing"
	"time"

	"github.com/consensys/gnark-crypto/ecc"
	fr "github.com/consensys/gnark-crypto/ecc/bn254/fr"
	"github.com/consensys/gnark-crypto/ecc/bn254/twistededwards/eddsa"
	tedwards "github.com/consensys/gnark-crypto/ecc/twistededwards"
	"github.com/consensys/gnark-crypto/hash"
	"github.com/consensys/gnark-crypto/signature"
	"github.com/consensys/gnark/backend/groth16"
	"github.com/consensys/gnark/frontend"
	"github.com/consensys/gnark/frontend/cs/r1cs"
	"github.com/consensys/gnark/std/algebra/twistededwards"
	"github.com/consensys/gnark/test"
)

type InputOutput struct {
	Omega     []fr.Element
	AskList   []fr.Element
	SNOldList []fr.Element

	Nu1     []byte
	Nu2     []byte
	CMOmega []byte

	XiUser   fr.Element
	XiCensus fr.Element
	Xi       fr.Element
	CMXi     []byte
	CMXiUser []byte

	SignedData []byte

	CensusPK        signature.PublicKey
	CensusSignature []byte
}

func TestXiCircuit(t *testing.T) {
	for _, numInputs := range []int{
		1, 2, 4, 8, 16,
	} {
		var sumS time.Duration
		var sumP time.Duration
		var sumV time.Duration

		n := 100

		for i := 0; i < n; i++ {
			timeS, timeP, timeV := RunBenchmark(t, numInputs, i)
			sumS += timeS
			sumP += timeP
			sumV += timeV
		}

		fmt.Println(numInputs, "Avg. setup time:", sumS/time.Duration(n))
		fmt.Println(numInputs, "Avg. proof time:", sumP/time.Duration(n))
		fmt.Println(numInputs, "Avg. verification time:", sumV/time.Duration(n))
	}
}

func RunBenchmark(t *testing.T, numInputs int, iteration int) (time.Duration, time.Duration, time.Duration) {

	assert := test.NewAssert(t)

	snarkCurve, err := twistededwards.GetSnarkCurve(tedwards.BN254)
	assert.NoError(err)

	vals := setUpInputOutput(t, numInputs)

	var circuit xiCircuit
	circuit.curveID = tedwards.BN254
	circuit.Omega = make([]frontend.Variable, len(vals.Omega))
	circuit.AskList = make([]frontend.Variable, len(vals.AskList))
	circuit.SNOldList = make([]frontend.Variable, len(vals.SNOldList))

	// verification with the correct data
	var assignment xiCircuit

	assignment.Omega = make([]frontend.Variable, len(vals.Omega))
	for i := 0; i < len(vals.Omega); i++ {
		assignment.Omega[i] = vals.Omega[i]
	}

	assignment.AskList = make([]frontend.Variable, len(vals.AskList))
	for i := 0; i < len(vals.AskList); i++ {
		assignment.AskList[i] = vals.AskList[i]
	}

	assignment.SNOldList = make([]frontend.Variable, len(vals.SNOldList))
	for i := 0; i < len(vals.SNOldList); i++ {
		assignment.SNOldList[i] = vals.SNOldList[i]
	}

	assignment.Nu1 = vals.Nu1
	assignment.Nu2 = vals.Nu2
	assignment.CMOmega = vals.CMOmega

	assignment.XiUser = vals.XiUser.Marshal()
	assignment.XiCensus = vals.XiCensus.Marshal()
	assignment.Xi = vals.Xi
	assignment.CMXi = vals.CMXi
	assignment.CMXiUser = vals.CMXiUser

	assignment.CensusSignedData = vals.SignedData

	assignment.CensusPK.Assign(snarkCurve, vals.CensusPK.Bytes())
	assignment.CensusSignature.Assign(snarkCurve, vals.CensusSignature)

	ccs, err := frontend.Compile(ecc.BN254, r1cs.NewBuilder, &circuit)
	if err != nil {
		panic(err)
	}

	t1 := time.Now()
	pk, vk, err := groth16.Setup(ccs)
	if err != nil {
		panic(err)
	}
	timeS := time.Since(t1)

	if iteration == 0 {
		fmt.Println("Total", ccs.GetNbConstraints(), "constraints")
	}

	witness, err := frontend.NewWitness(&assignment, ecc.BN254)
	if err != nil {
		panic(err)
	}

	publicWitness, err := witness.Public()
	if err != nil {
		panic(err)
	}

	t1 = time.Now()
	proof, err := groth16.Prove(ccs, pk, witness)
	if err != nil {
		panic(err)
	}
	timeP := time.Since(t1)

	t1 = time.Now()
	err = groth16.Verify(proof, vk, publicWitness)
	if err != nil {
		panic(err)
	}
	timeV := time.Since(t1)

	return timeS, timeP, timeV
}

func setUpInputOutput(t *testing.T, numInputs int) InputOutput {

	assert := test.NewAssert(t)

	var vals InputOutput

	// generate values to sign
	_, err := vals.XiUser.SetRandom()
	assert.NoError(err, "Setting random value (xi_U)")

	// Creating commitment for xiUser using MiMC
	hfunc := hash.MIMC_BN254.New()
	hfunc.Write(vals.XiUser.Marshal())
	vals.CMXiUser = hfunc.Sum(nil)

	_, err = vals.XiCensus.SetRandom()
	assert.NoError(err, "Setting random value (xi_R)")

	vals.Xi.Add(&vals.XiUser, &vals.XiCensus)

	hfunc2 := hash.MIMC_BN254.New()
	hfunc2.Write(vals.Xi.Marshal())
	vals.CMXi = hfunc2.Sum(nil)

	//numInputs := 2

	vals.Omega = make([]fr.Element, numInputs)
	for i := 0; i < numInputs; i++ {
		var temp fr.Element
		_, err := temp.SetRandom()
		assert.NoError(err)
		vals.Omega[i].Set(&temp)
	}

	// Sort Omega in ascending order
	sort.Slice(vals.Omega, func(i, j int) bool {
		if vals.Omega[i].Cmp(&vals.Omega[j]) <= 0 {
			return true
		} else {
			return false
		}
	})

	vals.AskList = make([]fr.Element, numInputs)
	for i := 0; i < numInputs; i++ {
		var temp fr.Element
		_, err := temp.SetRandom()
		assert.NoError(err)
		vals.AskList[i].Set(&temp)
	}

	vals.SNOldList = make([]fr.Element, numInputs)
	for i := 0; i < numInputs; i++ {
		vals.SNOldList[i] = hashfunctions.PFRSN(vals.AskList[i], vals.Omega[i])
	}

	// Creating serial number Nu1
	vals.Nu1 = hashfunctions.PRFNu(vals.Omega, fr.NewElement(1))

	// Creating serial number Nu2
	vals.Nu2 = hashfunctions.PRFNu(vals.Omega, fr.NewElement(2))

	// Creating commitment over vals.Omega
	hCMomega := hash.MIMC_BN254.New()
	for i := 0; i < len(vals.Omega); i++ {
		hCMomega.Write(vals.Omega[i].Marshal())
	}
	vals.CMOmega = hCMomega.Sum(nil)

	hfunc3 := hash.MIMC_BN254.New()
	hfunc3.Write(vals.CMXiUser)
	hfunc3.Write(vals.Nu1)
	hfunc3.Write(vals.XiCensus.Marshal())
	vals.SignedData = hfunc3.Sum(nil)

	// generate parameters for the signatures
	privKey, err := eddsa.GenerateKey(crand.Reader)
	assert.NoError(err, "generating eddsa key pair")

	// generate signature
	vals.CensusSignature, err = privKey.Sign(vals.SignedData[:], hash.MIMC_BN254.New())
	assert.NoError(err, "signing message")

	// check if there is no problem in the signature
	vals.CensusPK = privKey.Public()
	checkSig, err := vals.CensusPK.Verify(vals.CensusSignature, vals.SignedData[:], hash.MIMC_BN254.New())
	assert.NoError(err, "verifying signature")
	assert.True(checkSig, "signature verification failed")

	return vals
}

back to top

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API