Hello everyone,
I’ve created a little puzzle that follows the cryptographic principle of zero-knowledge proof.
Let P = xx, the age of Peter
To find xx, I will provide you with means to verify the statements of the puzzle, without giving you any direct informations about the ages of the characters.
The ages of the characters are not given but can be found.
Although there are an infinite number of answers that could verify the information I provide, there is one answer that can be verified to 99% assuming the puzzle is honest and verifiable, and that Peter has a realistic age and life.
How old is Peter ?
- Peter has 5 children, Matthew, Nancy, Phil, Quinlan and Ryan
- Peter’s age is the sum of the ages of all of his children
- The concatenation of his children’s ages forms a palindrom
- Peter’s age is a semi-prime number
- 2 of his children are the same age
- One of his children is half the age of one of his older siblings
- Quinlan is younger than Phil
- Only two of his children have a job
- At least 2 of his children have a palindrome age
- Matthew can’t read
- Peter didn’t have a child before the age of 30
- If x is the age of the child < 10, then we’ll write 0x, such that a 1 year-old child = 01
