Mini hash/KL diagnostic
Measures divergence from uniformity on toy SHA-256 prefixes.
PT mathematics / information
Reading easy/hard asymmetry as controlled loss of persistent structure.
A one-way function is easy to compute forward, but hard to invert. Intuitively, it keeps the result while dispersing the path.
PT gives a natural language for this: the forward map preserves enough structure to produce an output, while inversion must reconstruct persistence lost into entropy.
In a hash function, many inputs lead to fixed-size outputs. The information budget contracts; inversion requires recovering erased structure.
The page should remain a conceptual application unless scripts actually measure sieve or structural signatures.
The PT_Cryptographie and sha256-sieve-structure projects can support an experimental page: residue spectra, survivor classes, KL measures, collisions, and robustness tests.
The canonical status must remain careful: PT reading of informational asymmetry, not a general proof of cryptographic security.
GitHub repositories to publish: Igrekess/PT_Cryptographie, Igrekess/sha256-sieve-structure; 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.
GitHub repository to publish before this can become a download link.
Measures divergence from uniformity on toy SHA-256 prefixes.