随机排列排序系统中共轭可观测量的组合律
Composition Law of Conjugate Observables in Random Permutation Sorting Systems
AI总结:
本文发现随机排列排序系统中共轭可观测量的组合律,连接排列计数与时间,实现熵纯化,生成可证明均匀的随机性,实验验证熵达7.9998比特/字节。
摘要:
我们发现了随机排列排序系统(RPSS)中支配共轭可观测量的一个基本组合律。该定律通过一个函数关系将离散的排列计数Np与连续的时间T联系起来,该函数关系连接了时序分布的特征函数与排列计数的概率生成函数。这一框架实现了熵纯化,通过几何收敛将微架构时序波动转化为均匀随机性。我们建立了带有显式界的收敛定理,并在不同平台上通过实验验证了结果,实现了每字节超过7.9998比特的香农熵以及卡方均匀性。该组合律为从通用计算中生成可证明均匀的随机性提供了通用基础,从涌现的计算动力学中确保了密码学纯度。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。