Toy proof without revealing
Shows the difference between a verifiable property and a hidden witness in a toy protocol.
PT mathematics / proof
Why zero-knowledge proofs naturally speak about persistence of structure.
A zero-knowledge proof lets someone be convinced that you know something without revealing that thing.
From PT, this is almost a perfect image: one transmits a persistent trace sufficient to prove, without transmitting the whole structure.
The verifier receives an invariant, not the complete object. The proof preserves the property persistence, but dissipates unnecessary information about the witness.
This separation between persistent property and hidden content is exactly in the spirit of GFT.
The PT_ZKP project can be presented as a math-info application: protocols, constraints, witnesses, verification, and information budget.
Status: exploratory application of the PT reading, not a replacement for standard cryptographic ZKP theory.
GitHub repository to publish: Igrekess/PT_ZKP; monograph ch04_gft.
The links below point to public resources or planned GitHub repositories. No local working path is exposed to the reader.
GitHub repository to publish before this can become a download link.
Shows the difference between a verifiable property and a hidden witness in a toy protocol.