sdiehl / galois-fftLinks
Finite field polynomial arithmetic based on fast Fourier transforms
☆19Updated 5 years ago
Alternatives and similar repositories for galois-fft
Users that are interested in galois-fft are comparing it to the libraries listed below
Sorting:
- Finite field and algebraic extension field arithmetic☆53Updated last year
- Haskell library of algebraic topology☆26Updated 14 years ago
- Authenticated Data Structures☆16Updated 10 years ago
- "An Altruistic Processor", implemented in CLaSH (WARNING: incomplete code)☆13Updated 8 years ago
- convert simple cryptol expressions into finite-state machines☆22Updated 8 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 6 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- Clifford algebra for Haskell! :D☆14Updated 11 years ago
- topos programming☆31Updated 7 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- Coordinate-free hypersurfaces as Haskell types☆41Updated 9 months ago
- Exact real arithmetic in Haskell☆25Updated 4 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 4 months ago
- Pure Haskell implementation of SplitMix pseudo-random number generator☆26Updated 2 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- sliding fast fourier transform using haskell streaming☆13Updated 6 years ago
- A geometric algebra implementation in Haskell☆32Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- An append only list in a compact region☆25Updated 7 years ago
- ☆21Updated 7 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆17Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Manipulating numbers with inherent measurement/experimental uncertainty.☆25Updated last year
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- A Zoo of Haskell Newtype Wrappers☆14Updated 5 years ago