A complete, quantum-resistant cryptographic standard derived from a single algebraic identity — seven components covering hashing, symmetric encryption, digital signatures, zero-knowledge proofs, sender privacy, and OpenSSL integration, with zero free parameters and no reliance on algebraic hardness assumptions.
φCrypt relies solely on hash preimage and collision resistance — structural properties, not computational conjectures. There are no elliptic curves, no discrete logarithms, and no factoring problems for Shor's algorithm to attack.
Every constant — block size, round count, key width, tree height, security level — is a Fibonacci or Lucas number, provably derived from the golden ratio. Nothing is empirically tuned or arbitrarily chosen. All derivations are verified at compile time.
Hash, cipher, signatures, zero-knowledge proofs, address derivation, and compression all derive from the same root identity. The primitives compose without ad hoc glue because they share a common algebraic substrate.
Every component of the φCrypt standard is derived from the golden ratio and its self-similar algebraic structure. Block sizes, round counts, tree heights, key widths, and security levels are all Fibonacci or Lucas numbers — provably derived, not empirically chosen.
The root of φCrypt's security. A Fibonacci-structured hash function with a six-stage pipeline, avalanche-verified output, and a scalable chandas security ladder from 116 to 800+ bits.
A symmetric cipher with a Fibonacci-derived 273-byte block size, tribonacci cascade diffusion, and seven rounds — perfectly invertible, no padding, no IV required.
Stateless hash-based signatures on the SPHINCS+ paradigm with φ-derived parameters — over 2 million signatures per keypair, quantum-resistant by construction.
Sender-privacy ring membership proofs using a φHash Merkle accumulator — proves authorization is valid without revealing which key in the ring authorized the transaction.
Proves that transaction inputs equal outputs plus fee — without revealing amounts. Hash-based throughout, 128.3-bit security, no elliptic curves, no trusted setup.
Hierarchical deterministic address derivation — a single seed generates over two million receiving addresses in a three-level tree, fully hash-based, no key agreement required.
A SQLite VFS layer that encrypts every page at rest using φCipher CTR, derives keys with φHash KDF, and compresses with φCompress — invisible to the application.
QUIC and TLS 1.3 with the φCrypt cipher suite TLS_PHI_GCM_256_PHI_HASH_376 — quantum-resistant transport with no wire format changes, via the OpenSSL 3 provider.
Peer-to-peer networking with a Fibonacci spiral DHT — 13-peer cells, φHash peer placement, and φSign-authenticated peer records. Every routing decision is cryptographically verified.
Transport-agnostic JSON-RPC with φCompress frame codec and automatic QUIC → TLS-TCP → Unix socket fallback. Encryption delegated to the transport layer.
Every φAGI instance is born with a post-quantum cryptographic identity derived from φCrypt. Signed checkpoints and outputs ensure every inference is tamper-evident and traceable to a specific model instance.
Native φCrypt bindings for React Native — brings post-quantum signing, hashing, and encryption to iOS and Android applications without any changes to the underlying cryptographic standard.
Quantum Fourier Transform analysis on 64 consecutive φHash outputs. Peak spectral power: 0.211 — below the 0.25 random-function baseline. Pearson quantum walk correlation: 0.042. Confirmed: φHash has no period structure exploitable by Shor's algorithm.
φHash oracle decomposed into quantum circuits (T-gate count: ~140K per oracle call). Fault-tolerant Grover attack cost at Tier 2: ~1.05 million physical qubits, ~1085 years on IBM Heron R2. Tier 1 exceeds NIST Category 5 (188-bit post-Grover).
Full BB84 quantum key distribution integrated with φCrypt: 0.0% bit error on a clean channel, reliable eavesdropper detection (≥ 4/5 trials under intercept-resend attack). φHash privacy amplification produces a Tier 1 key delivered directly to φCipher.
Full methodology, circuit specifications, and test suite: Quantum Cryptography →
Every φCrypt primitive operates at a selectable security tier called a chandas (छन्दस् — Vedic meter). Each tier is a Fibonacci-derived output width. Tier ratios converge to φ as the ladder ascends, giving unbounded scalability without code branching.
29-byte output. Used internally for chaining, cipher keys, seed hashing, and message authentication. The lowest tier available; well above symmetric-key security thresholds for internal operations.
47-byte output. The standard tier for transactions, block headers, Merkle trees, and key images — the primary security level for all externally-visible protocol operations.
76-byte output. Used for keypairs, signatures, hub identity, HD addresses, and mining genesis — the tier for long-lived credentials and identities where the highest practical security is warranted.
123-byte output at chandas 3, growing by factor φ at each tier. Reserved for mining proof-of-work, where higher security levels raise the computation cost for block production.
All components are published under AGPLv3. For commercial deployment in closed-source products — embedded systems, proprietary SaaS, or products where copyleft conflicts — a commercial license is available.