16:34:51 <moneromooo> If anyone fancies having a quick look at a cryptosystem I shamelessly prodded a llm to work out with me, I made a proof of knowlege scheme for my game (a monero fork, so all data exchanged goes via the chain, all public, no private data exchnage). I would be grateful if someone could check whether it looks solid. I coded it and it works, I just want to know if it looks exploitable. The 
16:34:57 <moneromooo> stakes aren't high at all, it is meant to be a riddle system for the scripting engine. 36 lines of text, the crypto scheme itself is a dozen lines: https://paste.debian.net/hidden/e27f9150
16:49:39 <moneromooo> Actual code if interested: https://git.townforge.net/townforge/townforge/src/branch/cc-tmp/src/cc/cc_pok.cc (and .h)
17:07:02 <br-m> <jpk68:matrix.org> Is there any rough date for when the Trail of Bits audit will be released publicly?
17:56:15 <br-m> <atomfried:matrix.org> https://eprint.iacr.org/2026/1202
17:56:15 <br-m> <atomfried:matrix.org> maybe that is interesting for range proofs
19:57:53 <tevador> moneromooo: The proof of knowledge is basically a standard Schnorr signature of the nonce N. Technically, it proves the knowledge of the secret scalar x but not the knowledge of the riddle solution S. You need the mapping from S to x to be invertible (block cipher, not a hash).
20:07:56 <moneromooo> Oh that's quite enough for me to assume you know S if you know a hash of S + nonce.
20:09:01 <moneromooo> (assuming I'm not missing your point)
20:09:56 <moneromooo> Thanks for looking.