25 lines
No EOL
1 KiB
Text
25 lines
No EOL
1 KiB
Text
// Where's Waldo is a puzzle where the goal is to find Waldo in the picture of a crowd
|
|
// In this example, the crowd is a series of numbers, ideally* all prime but one, and Waldo is a non-prime number
|
|
// * we don't enforce only one number being non-prime, so there could be multiple Waldos
|
|
|
|
def isWaldo(field a, field p, field q) -> (field):
|
|
// make sure that p and q are both non zero
|
|
// we can't check inequalities, so let's create binary
|
|
// variables
|
|
field p1 = if p == 1 then 0 else 1 fi // "p != 1"
|
|
field q1 = if q == 1 then 0 else 1 fi // "q != 1"
|
|
q1 * p1 == 1 // "p1 and q1"
|
|
|
|
// we know how to factor a
|
|
a == p * q
|
|
|
|
return 1
|
|
|
|
// define all
|
|
def main(field a0, field a1, field a2, field a3, private field index, private field p, private field q) -> (field):
|
|
// prover provides the index of Waldo
|
|
field waldo = if index == 0 then a0 else 0 fi
|
|
waldo = waldo + if index == 1 then a1 else 0 fi
|
|
waldo = waldo + if index == 2 then a2 else 0 fi
|
|
waldo = waldo + if index == 3 then a3 else 0 fi
|
|
return isWaldo(waldo, p, q) |