Our webpage
Welcome to the CryptoNet public repository. Here you will be able to learn about and contribute to our Open Problems, RFPs, and Research Projects, as well as keep tabs on what we're planning for the future.
CryptoNet develops and applies new cryptographic tools to secure computation and communication systems. We facilitate the development and incorporation of cryptographic tools to increase security and privacy of communication, and engender new capabilities across the Web 3.0 stack. Much of our past and current work includes designing, proving, and improving the building blocks enabling Filecoin, a decentralized storage network.
CryptoNet aims to function as a Public Good Cryptography Lab providing technological empowerment to the creators and users of Web 3.0 technologies. We prefer to work collaboratively following a distributed and permissionless research model: our goal is to become a pass-through layer to cryptography research.
Please join the discussion to learn how you can work with us!
CryptoNet’s current foci are:
- Cryptographic primitives: Filecoin and other Web 3.0 technologies rely on the performance and security of cryptographic primitives. Our endeavours include Proof of Replication (PoRep), Proof of SpaceTime (PoST), SEALSTACK, SNARKs, and VDFs.
- Blockchain infrastructure: We are working to advance the state of the art of generic blockchain constructions.
- Web 3.0 protocol improvements: Our research contributes improvements to the transaction layer of the Filecoin protocol and its components, including mining, repair, security, and storage. These improvements may be generalized to other Web 3.0 technologies.
Much of CryptoNet’s past work is exhibited in the Filecoin Research website and GitHub repo.
We welcome discussion of our current Open Problems on our github discussion page. Please join us in exploring the future of public good cryptography by contributing to the solution of current problems and posing new ones!
| Research Area | Open Problem(s) | Short Description: |
|---|---|---|
| Proof of Space | Simple graph-labeling based PoS in the time model | See here |
| Graph-labeling based PoS in the cost model | ||
| Less communication rounds for repeated audits | ||
| Proof of Useful Space from hash-based PoS | ||
| Proof of Useful Space with Data Updatability | ||
| Tight hash-table based PoS construction | ||
| Incremental Cost for Parameter Upgrades | ||
| Verifiable Capacity Bound Functions | ||
| SNARKs | Scaling SNARKs | See here |
| Transparent SNARKs | ||
| SNARKs with Constant Proof Size | ||
| Multiprover Interactive Proofs | ||
| Better Polynomial Commitments for SNARKs | ||
| SNARKs for Privacy-Preserving Computation | ||
| Post-Quantum SNARKs | ||
| New Levels of Security for SNARK | ||
| Vector Commitments | Augmented Aggregation for SVC | See repo and pdf |
| Functional Vector Commitments | ||
| Improving Merkle Tree Openings | ||
| Updatability Property for SVC | ||
| Assumptions and Algebraic Settings for VC | ||
| Consensus | ||
| (to be added soon) | ||
As we develop and post RFPs, they will be posted on our page.
We are very interested in forming collaborations with researchers and engineers working in our fields of interest, and we offer several grants and research fellowships to support these working relationships. Please check out the PL Research website for further details and application instructions.
Please join us for discussion an anything in the CryptoNetLab orbit on our discussion forum
You can vew our current slate of publications, talks, and other resources on our webpage.
You can reach out to us anytime with your question and interest in these projects by emailing research@protocol.ai
Dual-licensed under MIT + Apache 2.0.