Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/philogy/remco-mul-verification
https://github.com/philogy/remco-mul-verification
Last synced: 11 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/philogy/remco-mul-verification
- Owner: Philogy
- License: mit
- Created: 2024-10-31T01:08:16.000Z (19 days ago)
- Default Branch: main
- Last Pushed: 2024-10-31T01:16:15.000Z (19 days ago)
- Last Synced: 2024-10-31T02:19:01.539Z (19 days ago)
- Language: Lean
- Size: 15.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Verification of Remco's full 256x256 bit multiplication
This repo attempts to verify Remco's widely used `mulDiv` function.
At the moment it **only verifies** that the computation of the upper 256 bits of the 512 bit product
via `sub(sub(x1, x0), lt(x1, x0))` is verified.
Furthermore it verifies a specialization of `fullMulDiv` where the denominator is fixed to `2^128`.
Credit to Remco Bloemen under MIT license: [2π.com/17/chinese-remainder-theorem/](https://xn--2-umb.com/17/chinese-remainder-theorem/)