About Codex

The Codex team is working on a next-generation storage engine that attempts to “untie the knot” of incentivized storage. We’re building Codex to be a reliable and predictable p2p storage infrastructure that will allow for many business and casual use cases. We rely on strong data possession (PoR and PDP) and incentive schemes to guarantee long-term persistence and data availability. Check some of our current research here: https://github.com/status-im/codex-research

Students Program

This program is available to undergraduate and graduate students officially enrolled on a university, pursuing their B.Sc. or M.Sc. in the field of Computer Sciences or a related domain. The duration of the program could be between 3 and 6 months. 
The Codex Student Program aims to do research and development in, but not limited to:

  • P2P and distributed computing scheme: leader election, consensus algorithms
  • Proofs of (non-)inclusion, retrievability proofs, availability proofs, fraud proofs
  • Game theory, incentivization, tokenomics
  • Decentralized storage systems, erasure coding, and storage related proofs
  • Storage performance measurement and testing

Bonus if you have experience in

  • Distributed system
  • Storage and I/O
  • P2P networking
  • Analytical modeling
  • Scalable simulations
  • Data analytics
  • Parallel programming
  • Stress testing
  • Continuous integration
  • Technical writing

[The above is not a requirement we’d still love to hear from you anyway if you think you’d be a great fit for this role!]

Apply for this Job

* Required
resume chosen  
(File types: pdf, doc, docx, txt, rtf)
cover_letter chosen  
(File types: pdf, doc, docx, txt, rtf)

Enter the verification code sent to to confirm you are not a robot, then submit your application.

This application was flagged as potential bot traffic. To resubmit your application, turn off any VPNs, clear the browser's cache and cookies, or try another browser. If you still can't submit it, contact our support team through the help center.