c68e38b943
Right now AVX2 implementation looses to C binding in speed. This is probably, because of 2 things: 1. Go does not inline `mulBitRightx2` in loop iteration. 2. `minmax` is loaded every time from memory. In this PR: 1. Unroll `mulBitRightx2` manually and use `mulByteRightx2` instead. 2. Generate `minmax` in place without `LOAD/LEA` instructions.
64 lines
No EOL
1.5 KiB
Markdown
64 lines
No EOL
1.5 KiB
Markdown
# Demo
|
|
|
|
[](https://asciinema.org/a/IArEDLTrQyabI3agSSpINoqNu)
|
|
|
|
**In project root:**
|
|
|
|
```bash
|
|
# show help
|
|
make
|
|
# run auto demo
|
|
make auto
|
|
```
|
|
|
|
# Homomorphic hashing in golang
|
|
|
|
Package **tz** containts pure-Go implementation of hashing function described by Tillich and Źemor in [1] .
|
|
|
|
There are existing implementations already (e.g. [2]), however it is written in C.
|
|
|
|
Package **gf127** contains arithmetic in GF(2^127) with _x^127+x^63+1_ as reduction polynomial.
|
|
|
|
# Description
|
|
|
|
It can be used instead of Merkle-tree for data-validation, because homomorphic hashes
|
|
are concatable: hash sum of data can be calculated based on hashes of chunks.
|
|
|
|
The example of how it works can be seen in tests.
|
|
|
|
# Benchmarks
|
|
|
|
## AVX vs AVX2 version
|
|
|
|
```
|
|
BenchmarkAVX-8 500 3492019 ns/op 28.64 MB/s 64 B/op 4 allocs/op
|
|
BenchmarkAVX2-8 500 2752693 ns/op 36.33 MB/s 64 B/op 2 allocs/op
|
|
BenchmarkAVX2Inline-8 1000 1877260 ns/op 53.27 MB/s 64 B/op 2 allocs/op
|
|
```
|
|
|
|
# Contributing
|
|
|
|
At this moment, we do not accept contributions. Follow us.
|
|
|
|
# Makefile
|
|
|
|
```
|
|
→ make
|
|
Usage:
|
|
|
|
make <target>
|
|
|
|
Targets:
|
|
|
|
attach Attach to existing container
|
|
auto Auto Tillich-Zémor hasher demo
|
|
down Stop demo container
|
|
help Show this help prompt
|
|
up Run Tillich-Zémor hasher demo
|
|
```
|
|
|
|
# Links
|
|
|
|
[1] https://link.springer.com/content/pdf/10.1007/3-540-48658-5_5.pdf
|
|
|
|
[2] https://github.com/srijs/hwsl2-core |