Add comprehensive academic proofs and formal verification

[hyperpolymath]

This commit adds extensive academic documentation covering all theoretical foundations required for rigorous academic scrutiny of the Oblibeny oblivious computing ecosystem.

Documentation includes:

Foundations:

• Set-theoretic foundations and memory models
• Type-theoretic security (information flow, linear types, effects)
• Categorical semantics (monads, functors, natural transformations)
• Probability theory (concentration bounds, negligible functions)
• Algebra and number theory (groups, fields, lattices, elliptic curves)
• Logic and proof theory (modal, temporal, separation logic)

Cryptography:

• ORAM security proofs (Path ORAM, Circuit ORAM, recursive ORAM)
• Encryption primitives (AES-GCM, PRFs, Merkle trees, commitments)

Formal Methods:

• Formal verification (Hoare logic, refinement, model checking)
• Program analysis (abstract interpretation, taint tracking)
• Concurrency theory (linearizability, consensus, Byzantine FT)

Complexity and Information Theory:

• Time/space/communication complexity with lower bounds
• Information-theoretic leakage analysis
• Statistical security methodology

Engineering:

• RISC-V ISA extensions for oblivious computing
• Protocol specifications (client-server, filesystem)

Also includes:

• Technical white paper with complete system overview
• Index with reading guides for different audiences
• Consolidated TODO list with prioritized future work

Total: 19 AsciiDoc files covering all academic requirements