Homonyms
security
nox security security properties and formal guarantees of nox security bounds attack surface formal properties Turing completeness Theorem: nox is Turing-complete. Proof: Construct encoding of arbitrary Turing machine M via patterns 0-4, 9. β confluence Theorem: nox is confluent. Proof: Orthogonalβ¦
cyb/wysm/SECURITY
Reporting a vulnerability If you identify a potential security vulnerability, we kindly request refraining from using the issue tracker or engaging in public discussions to mitigate the risk of exacerbating the situation. Such vulnerabilities should be promptly reported via email to:β¦
soft3/hemera/docs/explanation/security
ecosystem context Poseidon2 deployment landscape | System | Field | t | R_F | R_P | Capacity | Status | |---|---|---|---|---|---|---| | Plonky3 | Goldilocks | 12 | 8 | 22 | 4 (128-bit) | Production | | SP1 | BabyBear | 16 | 8 | 13 | 8 (124-bit) | Production | | RISC Zero | BabyBear | 16 | 8 | 13 |β¦
soft3/zheng/docs/explanation/security
security properties the security of zheng reduces to a single assumption: the collision resistance of hemera. every proof, every verification, every recursive composition β all of it rests on the hardness of finding two distinct inputs that produce the same hemera digest. if hemera is secure, zhengβ¦