0
$\begingroup$

The specific case I'm asking this question for is a ZK-version of a Wordle game that I'm working on: https://github.com/alxkzmn/zk-wordle/blob/master/circuits/wordle.circom I represent the 5-letter word as an ASCII array signal input solution[5]; where each element is an ASCII code of the corresponding letter. What is the best way to hash that 5-letter word that is reproducible in other programming languages (to be able to compare the output hash with a publicly committed hash outside of the proof)?

New contributor
Alex Kuzmin is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$

0

Your Answer

Alex Kuzmin is a new contributor. Be nice, and check out our Code of Conduct.

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.