Thomas Piellard
Applied Researcher Privacy Preserving Protocol at ConsenSys
Saint-Martin-d'Hères, Auvergne-Rhône-Alpes, France
Summary
🤩
Rockstar🎓
Top SchoolThomas Piellard is an applied researcher specializing in privacy-preserving protocols and zero-knowledge proof systems with seven years of experience in applied cryptography. Based at ConsenSys in Grenoble, he contributes to high-impact open-source projects like gnark and gnark-crypto, focusing on backend refactoring and optimization of polynomial commitments and finite-field/elliptic-curve arithmetic. His background includes hands-on cryptanalysis and side-channel/fault-attack tooling at CEA-LETI, where he applied machine learning and C++/Python engineering to practical hardware security problems. Trained in rigorous French mathematics and cryptology programs, he blends deep theoretical knowledge with production-grade cryptographic engineering. Notably, his work improves core primitives that power zk-SNARK implementations, an under-the-hood contribution critical to scalable privacy systems.
7 years of coding experience
Master's degree, Master sécurité cryptologie et codage de l'information, Master's degree, Master sécurité cryptologie et codage de l'information at Université Grenoble AlpesMathematics, Mathematics at AgrégéClasses préparatoires aux grandes ecoles, MP, Classes préparatoires aux grandes ecoles, MP at Lycée Berthollet
French, English
Github Skills (17)
algorithm10
crypto10
elliptic-curve-cryptography10
crypt10
go10
cryptography10
finite-field10
testing9
fftw9
code-optimization9
algorithms9
optimisation9
fft9
numerical-optimization9
optimization9
Programming languages (3)
Github contributions (5)
Consensys/gnark
Mar 2020 - Jan 2023
gnark is a fast zk-SNARK library that offers a high-level API to design circuits. The library is open source and developed under the Apache 2.0 license
Role in this project:
Back-end Developer
Back-end DeveloperContributions:103 reviews, 458 commits, 117 PRs in 2 years 11 months
Contributions summary:Thomas's commits focus on cleaning up and refactoring existing code related to the implementation of polynomial commitments and arithmetic operations within the gnark-crypto project. Their work primarily involves the underlying field operations and polynomial structures used for cryptographic primitives. The tasks include code generation, streamlining the representation of linear expressions and the handling of various cryptographic elements to improve functionality.
gnarkzkpzksnarkzk-snarksr1cs
Consensys/gnark-crypto
Mar 2020 - Jan 2023
gnark-crypto provides elliptic curve and pairing-based cryptography on BN, BLS12, BLS24 and BW6 curves. It also provides various algorithms (algebra, crypto) of particular interest to zero knowledge proof systems
Role in this project:Back-end Developer
Back-end DeveloperContributions:71 reviews, 406 commits, 69 PRs in 2 years 10 months
Contributions summary:Thomas's commits primarily involve refactoring and optimization efforts within the `gnark-crypto` repository, with a focus on mathematical computations. Specifically, the user's contributions center on modifying and optimizing arithmetic operations within the finite field and elliptic curve cryptography parts of the codebase, especially related to polynomial commitments for cryptographic applications such as zero-knowledge proofs. These changes suggest a backend developer working within the domain of cryptographic primitives.
cryptocryptographyelliptic-curvegnarkproof-system
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.