Irreducible's mission it to accelerate the zero-knowledge revolution with the world's fastest proof generation. Join us at Irreducible as we accelerate the ZK revolution by supporting web3 networks with reliable and cost-efficient proof generation. We’re a high-performance cryptography startup (with an exciting hardware twist) looking for a talented Language Engineer. A more technical description of what we do is below!
Role Overview
As a Language Engineer on the Cryptography team, you will work on the programming language layers on top of Binius, our binary field proof system. The challenges relate to expressing programs that can be proven and verified with Binius. You will work primarily on new initiatives at Irreducible that may involve the Binius constraint-programming framework, domain-specific languages, and compilation toolchains targeting verifiable virtual machines (VMs). You will work on a cross-functional team, collaborating with cryptographers, research engineers, and software engineers to build developer-friendly frontend technology on top of Binius. There may be opportunities to contribute directly to Irreducible’s research publications.
Role Qualifications
Bonus Qualifications
Locations supported:
We’re looking for candidates who are located between the USA East Coast and Central Europe time zones.
We are also in the process of opening an office in Berlin, and are excited to support relocation, on a case by case basis. Once our office is open, we plan to bring the whole company together for ~one week per quarter in Berlin.
We have a globally distributed company, and ensuring the team works in a cohesive way is our main goal.
About us:
We're building out a high-performance, cost-efficient compute stack for advanced cryptographic proofs, specifically zk-SNARKs. Verifiable computing with zk-SNARKs is taking off as a solution to the scalability and privacy limitations that today's blockchains suffer from. A new wave of blockchain protocols that use zk-SNARKs to prove smart contract executions, such as Polygon zkEVM, Starknet, and zkSync, are already in production. We believe there is a big market opportunity to generate proofs for these networks at scale in a cost-effective way [1]. There are lots of interesting performance engineering challenges we need to solve to keep up with the maximum device throughput.
We take the approach of co-designing hardware and software systems to accelerate SNARK generation end-to-end. Our first-generation tech stack uses FPGA accelerators running custom digital logic tailor-made for our use case [2].
We also conduct cryptography research to identify computationally efficient algorithms for verifiable computing. These research efforts produced a novel cryptographic construction based on towers of binary fields called Binius [3] [4], which we are currently developing into a production-grade system.
Our team has cross-domain expertise and includes hardware designers, low-level systems software engineers, cryptography engineers, and data center specialists, several of whom worked in HFT previously.
[1] https://www.paradigm.xyz/2022/04/zk-hardware
[2] https://www.ulvetanna.io/news/fpga-architecture-for-goldilocks-ntt
[3] https://www.ulvetanna.io/news/binius-hardware-optimized-snark
[4] https://cointelegraph.com/news/vitalik-buterin-explains-binius-improve-zero-knowledge-proofs
[5] https://www.ulvetanna.io/news/introducing-ulvetanna
To all recruitment agencies: Irreducible does not accept agency resumes. Please do not forward resumes to our jobs alias, Irreducible employees, or any other organisation location. Irreducible is not responsible for any fees related to unsolicited resumes. Please read our full policy here.
Grand Patrimoine de Loire-Atlantique
The Royal Australian College of General Practitioners (RACGP)
Community Staffing Australia
Anglian Home Improvements
DualEntry
