MCPcopy Create free account

hub / github.com/actuallyachraf/zkstarks / functions

Functions30 in github.com/actuallyachraf/zkstarks

↓ 19 callersMethodSend
Send appends items to the channel state by hashing them
fs.go:43
↓ 5 callersFunctionNewChannel
NewChannel creates a new instance of the FS channel
fs.go:35
↓ 5 callersMethodRandInt
RandInt emulates a random integer scalar in the range [min,max] sent by the verifier
fs.go:54
↓ 5 callersFunctionserializeAuditPath
serializeAuditPath serializes a merkle audithash
fri.go:151
↓ 2 callersFunctionDomainBytes
DomainBytes returns a byte serialized domain element set
fri.go:129
↓ 2 callersFunctionDomainHash
DomainHash returns a merkle root of the domain elements
fri.go:117
↓ 2 callersFunctionNextFRILayer
NextFRILayer constructs the next FRI layer a Layer is a tuple consisting of an evaluation domain and polynomial to create the next fri layer we evalua
fri.go:96
↓ 2 callersMethodRandFE
RandFE emulates a random field element sent by the verifier given the field's modulus.
fs.go:75
↓ 2 callersFunctionevenCoeffs
The FRI folding operator is a map on polynomial coefficients. For a given polynomial it folds it's coefficients by summing consecutive pairs of even/o
fri.go:46
↓ 2 callersFunctionhash
(b []byte)
fs.go:89
↓ 2 callersFunctionoddCoeffs
oddCoeffs extracts a new polynomial using odd index coefficients
fri.go:62
↓ 1 callersFunctionDecommitFRILayers
In order to verify the commitment proofs we need to implement to new functions the first will will send the FS channel data to verify that each FRI la
fri.go:219
↓ 1 callersFunctionDecommitOnQuery
Decommiting on the trace polynomial involves verifying the evaluation of the composition polynomial The value f(x) with its authentication path. The v
fri.go:261
↓ 1 callersFunctionFRIDecommit
FRIDecommit receives random values from the verifier (using FS) and decommits on each query index.
fri.go:304
↓ 1 callersFunctionGenElems
The unisolvence theorem states that given n+1 pairs of points (x_i,y_i) there exists a polynomial Q of degree at most n such as Q(x_i) = y_i Our Fibon
stark.go:225
↓ 1 callersFunctionGenSeq
GenSeq computes the actual sequence
stark.go:195
↓ 1 callersFunctionGenerateFRICommitment
GenerateFRICommitment given the composition polynomial the evaluation domain, the evaluations on said domain and the first commitment root.
fri.go:172
↓ 1 callersFunctionGenerateProgramConstraints
The FibSeq program we want to prove validity statements can be proven correct if some constraints over it's output are valid. Mainly if FibSeq represe
constraint.go:31
↓ 1 callersFunctionNextFRIDomain
FRI Layers construction We start with the evaluation domain generated during the domain parameters generation. We define a function called NextFRIDoma
fri.go:22
↓ 1 callersFunctionNextFRIPolynomial
NextFRIPolynomial creates the next FRI polynomial.
fri.go:78
↓ 1 callersMethodUnmarshalJSON
UnmarshalJSON parses a JSON serialized domain parameters instance.
stark.go:113
↓ 1 callersFunctionconcat
(a, b []byte)
fs.go:86
↓ 1 callersFunctioncosetDomainBytes
cosetDomainBytes returns a byte serialized domain element set
fri.go:140
↓ 1 callersFunctiongeneratePoints
(x []ff.FieldElement, y []ff.FieldElement)
stark.go:295
FunctionGenerateDomainParameters
GenerateDomainParameters reproduces the domain parameters required for proof generation : a : the trace of FibSeq(1,3141592) g : generator of the subg
stark.go:249
MethodMarshalJSON
MarshalJSON populates the JSON properly for unexported fields
stark.go:56
FunctionTestFRIOperations
(t *testing.T)
fri_test.go:11
FunctionTestFiatShamirChannel
(t *testing.T)
fs_test.go:14
FunctionTestZKGen
(t *testing.T)
stark_test.go:14
Functionmain
()
cmd/main.go:3