Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.08013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912638575837184 |
|---|---|
| author | Kuang, Yurang R. |
| author_facet | Kuang, Yurang R. |
| contents | We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a functional relation connecting the characteristic function of timing distributions to the probability generating function of permutation counts. This framework enables entropy purification, transforming microarchitectural timing fluctuations into uniform randomness via geometric convergence. We establish convergence theorems with explicit bounds and validate the results experimentally, achieving Shannon entropy above 7.9998 bits per byte and chi-square uniformity across diverse platforms. The composition law provides a universal foundation for generating provably uniform randomness from general-purpose computation, securing cryptographic purity from emergent computational dynamics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08013 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Composition Law of Conjugate Observables in Random Permutation Sorting Systems Kuang, Yurang R. Cryptography and Security Data Analysis, Statistics and Probability We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a functional relation connecting the characteristic function of timing distributions to the probability generating function of permutation counts. This framework enables entropy purification, transforming microarchitectural timing fluctuations into uniform randomness via geometric convergence. We establish convergence theorems with explicit bounds and validate the results experimentally, achieving Shannon entropy above 7.9998 bits per byte and chi-square uniformity across diverse platforms. The composition law provides a universal foundation for generating provably uniform randomness from general-purpose computation, securing cryptographic purity from emergent computational dynamics. |
| title | Composition Law of Conjugate Observables in Random Permutation Sorting Systems |
| topic | Cryptography and Security Data Analysis, Statistics and Probability |
| url | https://arxiv.org/abs/2510.08013 |