Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/actuallyachraf/zkstarks
/ functions
Functions
30 in github.com/actuallyachraf/zkstarks
⨍
Functions
30
◇
Types & classes
3
↓ 19 callers
Method
Send
Send appends items to the channel state by hashing them
fs.go:43
↓ 5 callers
Function
NewChannel
NewChannel creates a new instance of the FS channel
fs.go:35
↓ 5 callers
Method
RandInt
RandInt emulates a random integer scalar in the range [min,max] sent by the verifier
fs.go:54
↓ 5 callers
Function
serializeAuditPath
serializeAuditPath serializes a merkle audithash
fri.go:151
↓ 2 callers
Function
DomainBytes
DomainBytes returns a byte serialized domain element set
fri.go:129
↓ 2 callers
Function
DomainHash
DomainHash returns a merkle root of the domain elements
fri.go:117
↓ 2 callers
Function
NextFRILayer
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 callers
Method
RandFE
RandFE emulates a random field element sent by the verifier given the field's modulus.
fs.go:75
↓ 2 callers
Function
evenCoeffs
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 callers
Function
hash
(b []byte)
fs.go:89
↓ 2 callers
Function
oddCoeffs
oddCoeffs extracts a new polynomial using odd index coefficients
fri.go:62
↓ 1 callers
Function
DecommitFRILayers
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 callers
Function
DecommitOnQuery
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 callers
Function
FRIDecommit
FRIDecommit receives random values from the verifier (using FS) and decommits on each query index.
fri.go:304
↓ 1 callers
Function
GenElems
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 callers
Function
GenSeq
GenSeq computes the actual sequence
stark.go:195
↓ 1 callers
Function
GenerateFRICommitment
GenerateFRICommitment given the composition polynomial the evaluation domain, the evaluations on said domain and the first commitment root.
fri.go:172
↓ 1 callers
Function
GenerateProgramConstraints
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 callers
Function
NextFRIDomain
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 callers
Function
NextFRIPolynomial
NextFRIPolynomial creates the next FRI polynomial.
fri.go:78
↓ 1 callers
Method
UnmarshalJSON
UnmarshalJSON parses a JSON serialized domain parameters instance.
stark.go:113
↓ 1 callers
Function
concat
(a, b []byte)
fs.go:86
↓ 1 callers
Function
cosetDomainBytes
cosetDomainBytes returns a byte serialized domain element set
fri.go:140
↓ 1 callers
Function
generatePoints
(x []ff.FieldElement, y []ff.FieldElement)
stark.go:295
Function
GenerateDomainParameters
GenerateDomainParameters reproduces the domain parameters required for proof generation : a : the trace of FibSeq(1,3141592) g : generator of the subg
stark.go:249
Method
MarshalJSON
MarshalJSON populates the JSON properly for unexported fields
stark.go:56
Function
TestFRIOperations
(t *testing.T)
fri_test.go:11
Function
TestFiatShamirChannel
(t *testing.T)
fs_test.go:14
Function
TestZKGen
(t *testing.T)
stark_test.go:14
Function
main
()
cmd/main.go:3