Skip to main content

Questions tagged [starks]

The tag has no usage guidance.

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2 votes
0 answers

It is possible to verify the computation of a hash function without actually proving it in zero knowledge?

Let me first introduce the context: Let's say that we have a hash function evaluation: $$h = H(x, y),$$ where $x$ and $y$ are the public and the private input of the hash function $H$, respectively. ...
Bean Guy's user avatar
  • 752
2 votes
0 answers

Assumptions underlying the soundness of STARKs

STARKs have recently received quite a lot of attention due to their small proof size and supposedly simple assumptions. The paper introduction itself seems to mainly state that their construction is ...
Cryptonaut's user avatar
  • 1,076
1 vote
0 answers

ZK-STARK soundness

I've been reading about ZK-STARK. There's an example that appears in several blogs. The most detailed explanation of that specific example which I have found so far is in this blog. The description of ...
artificial_inspector's user avatar
1 vote
1 answer

Unable to understand Eli Ben Sasson's STARK arithmetization & proof example

This is from this video - Bob has a list of length $10^6$. Bob wants to convince Alice that every number in the list is between 1 & 10. Alice needs to ...
user93353's user avatar
  • 2,295
1 vote
0 answers

How can we explain STARK with less math?

I am trying to understand STARK with not much math. I understand SNARK like this: Computation → Arithmetic Circuit → R1CS → QAP → zk-SNARK From the helpful article: ...
manu muraleedharan's user avatar