Repository files navigation

This is a PoC implementation of a STARK verifier for the Fibonacci-Square sequence calculation proof.
The original proved statement and prover code taken from theSTARK101 repository by StarkWare.

• A flat list of byte strings is used for the channel queue (it might be beneficial to use structured data)
• Merkle proofs are serialized in the reversed order (to simplify verification)
• Channel state is initialized with an empty byte string0x (a hash of some public input should be used)
• Single random query is sampled (should be multiple)
• Some values that do not depend on the channel state are pre-calculated and hardcoded in the contract code

The verifier contract is deployed inGhostnet:

• Allocated storage: 3663 bytes (~1 tez)
• Verifier gas consumption (single query): 4256 (~0.01 tez)

• STARK101 tutorialhttps://starkware.co/stark-101/
• Basecamp STARK mathhttps://www.youtube.com/watch?v=jg9KSNOO2XY