A tool for verifying transitions in cryptographic game-hopping proofs

High-scale Federated Learning (10M nodes) with formal BFT verification. Features 10ms zk-SNARKs and a 2026 PQC Overhaul: enforcing x25519-mlkem768 hybrid KEX, XMSS TPM-attestation, and epoch-based quantum-resistant ledger migration. Includes Go node agent + Python SDK v2.

The following project should define a PDA that in its turn would recognize a specific context-free language.

The following example is meant to demonstrate how a Deterministic Finite Automata(DFA) algorithm is supposed to guide identify whether a string is an email adress ending with .gov or .gr

Natural deduction proof assistant

Stop AI agents from taking destructive actions they weren't authorized to. Actenon gates consequential actions, payments, deletes, deploys, access changes, so nothing executes without a cryptographic proof bound to that exact action. Every decision leaves a verifiable receipt. Open-source, runs locally. No valid proof, no execution.

AI supporting the Langlands Program

Math Mindscape dives into core discrete math concepts like logic, proofs, set theory, functions, relations, combinatorics, graph theory, and related algorithms. Each topic includes clean Python code and examples to reinforce understanding through practice. It’s a go-to repo for revision, self-study, and building strong fundamentals in CS

Collapse System Logic — deterministic proof collapse (E→Z→1)

generates a truth table from a boolean expression

Full proof presented for evaluation for the Riemann Hypothesis