janestreet / perfetto
Frontend for magic-trace; forks https://ui.perfetto.dev
☆27Updated last year
Related projects: ⓘ
- a web page / paper☆18Updated 7 years ago
- An AES-based 384 bit permutation.☆18Updated 5 years ago
- A ziglang implementation of the SSZ serialization protocol☆18Updated last month
- Shared Lurk source code, including tests and library code.☆18Updated 6 months ago
- Embedded curve over the Ristretto255 scalar field, for use in Bulletproofs☆17Updated 5 years ago
- A tiny nearest-neighbor embedding database written in C☆19Updated last year
- ☆19Updated this week
- Public notes, etc. for CMPSCI 630, the UMass CS graduate systems course.☆20Updated last year
- How fast can we brute force a 64-bit comparison?☆52Updated 4 years ago
- Structural (non-cryptographic) Python implementation of the Avalanche algorithm by TeamRocket☆15Updated 6 years ago
- Proving a blocking queue deadlock free in a dozen different ways☆42Updated 3 years ago
- LibSWIFFT - A fast C/C++ library for the SWIFFT secure homomorphic hash function☆26Updated 9 months ago
- Implementation of popular consensus protocols☆22Updated 3 years ago
- ☆20Updated this week
- ☆21Updated 4 years ago
- ☆9Updated last year
- C++ library for evaluating arithmetic circuits on batches of inputs☆15Updated 8 years ago
- PL Reading Group Website☆14Updated last year
- An implementation of the append-only log described in the Certificate Transparency specification (RFC 6962)☆34Updated last year
- A TLA+ formalization of the algorithm described in "Paxos Made Simple"☆18Updated last month
- Xoodyak, a lightweight and versatile cryptographic scheme implemented in Rust.☆29Updated 6 months ago
- A compiler for secure multiparty computation☆49Updated 8 years ago
- Signature schemes from the paper "Signature Schemes and Anonymous Credentials from Bilinear Maps" by Jan Camenisch and Anna Lysyanskaya☆12Updated 3 years ago
- DRAT proof processor☆13Updated last year
- Rust bindings to formally-proven field arithmetic operations from MIT's fiat-crypto project☆12Updated 4 years ago
- Naehrig, Niederhagen and Schwabe's pairings code, massaged into a shared library.☆17Updated 8 years ago
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 3 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated last year
- ☆14Updated 9 years ago
- Optimized Binary GCD for Modular Inversion☆42Updated 3 years ago