Sebastien La Duca
Software Engineer at San Francisco Compute Company
United States
Summary
🤩
Rockstar🎓
Top SchoolSebastien La Duca is a software engineer with nine years of experience specializing in zero-knowledge proofs and high-performance cryptographic systems. He has driven core contributions to notable open-source projects like plonky2—improving usability, parallelism, and logical gadgets for STARK/PLONK tooling—and built recursive-verifier frameworks for verifiable, horizontally scalable blockchain dataflows. His roles span hands-on research engineering at Proxima One to CTO-level leadership at Nocturne Labs and board-level strategy at the Blockchain Acceleration Foundation, blending deep technical delivery with product and governance experience. At San Francisco Compute Company he continues applying that stack-level expertise to production systems. Sebastien pairs a Carnegie Mellon ECE background with practical implementations such as Merkle B+ trees with KZG commitments and hand-written STARKs for VM and Ethereum primitives, indicating both theoretical depth and low-level systems craft. He’s comfortable operating at the intersection of crypto research, systems engineering, and open-source stewardship.
9 years of coding experience
4 years of employment as a software developer
Bachelor of Science - BS Electrical and Computer Engineering, Bachelor of Science - BS Electrical and Computer Engineering at Carnegie Mellon University
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (6)
rust10
cryptography10
algorithms8
algorithm8
data-structures8
data-structure8
Programming languages (13)
Github contributions (5)
0xPolygonZero/plonky2
Jan 2022 - Dec 2022
Role in this project:
Back-end Developer
Back-end DeveloperContributions:9 reviews, 35 commits, 17 PRs in 11 months
Contributions summary:Sebastien primarily focused on enhancing the `plonky2` codebase by making internal functionalities public and adding support for parallel processing. Their contributions include modifying the `HashOutTarget` structure, making `recover_degree_bits` public for various proof types, and adding a Rayon shim. Furthermore, they implemented the "or" gadget for logical operations. These changes suggest a focus on improving usability, performance, and functionality within the Stark-based cryptographic proving system.
Sladuca/CodeMems
Jul 2019 - Oct 2019
Contributions:266 commits, 2 PRs, 38 pushes in 3 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.