KeyAI Research · Inactive research initiative
This website preserves historical work in elliptic-curve cryptography, formal mathematics, and AI research. Published proofs, code, and results remain available for review and reproducibility.
Each entry has a source and a scope.
How to read the evidence
Selected results
These examples explain what a checked statement gives you, where it stops, and how to inspect it.
Formal result · Kernel audited
Over the algebraic closure, secp256k1 has 16 points killed by multiplication by four, forming a group isomorphic to (Z/4Z)².
Formal result · Kernel + compiler
A formal primality certificate establishes that the secp256k1 field modulus p is prime.
Formal result · Kernel standard
An entire complex function bounded by C · (1 + |z|)ⁿ is represented by a polynomial of degree at most n.
Published research
The published cryptographic work examines the discrete-logarithm problem on secp256k1, including algebraic structure, proposed routes, and the evidence needed to evaluate them.
A separate ResearchOS ledger contains reusable formal analysis and number theory.
The repository does not solve ECDLP. No secp256k1 break or proof of the Riemann Hypothesis is claimed.
Explore the research directions →Research OS · Inactive
A research project needs more than its latest successful proof. It needs the sources, failed attempts, assumptions, and decisions that explain what to do next.
Research OS connects those records in a public reference deployment. A hosted multi-project product is not yet available.
For researchers and technical collaborators
Questions about published results, assumptions, source code, and reproducibility are welcome. KeyAI is inactive and is not recruiting a team or pilot participants.
Discuss the published work