-
Adler-32 and CRC-32 computations are fast with SIMD, but if you just want the fastest possible PNG decoder (e.g. to compare to QOI's speed), ignoring the checksums can be even faster.
For decode (n…
-
Either event based like ALiVE apparently does it, see:
https://github.com/gruppe-adler/grad-persistence/issues/31#issuecomment-637957436
Or mark fortifications on placement in grad-fortifications,…
-
Doron Adler shared a link to a bunch of fine tuned models i.e. transfer learning from a base model for just a few ticks.
https://twitter.com/Norod78/status/1255237713118343168
These often give w…
-
### Related Issues
- #2
- #42
### zlib - 1.2.5 Copyright 1995-2010 Jean-loup Gailly and Mark Adler
https://zlib.net/
### code based on "xma_parse" code written by HCS
https://hcs64.com/con…
-
At some point, we had advertised that MMIF would encode file checksums in the `Document` objects for checking data integrity. I want to bring it to the discussion, specifically related to these questi…
-
### Describe the issue
The Linux ARM/aarch64 version of AWS CLI v2 in `2.17.18` has `zlib 1.2.7` in `libz.so.1`
zlib 1.2.8 has security vulnerability report on [NIST](https://nvd.nist.gov/vuln/d…
-
**Checklist**
- [X ] Check if there is already an [example config](https://github.com/lldap/lldap/tree/main/example_configs) for it.
- [ X] Try to figure out the configuration values for the new ser…
-
### Background and motivation
Currently there is no non-stream based apis to zlib compression. As such I feel like an encoder / decoder implementation is needed similar to the Brotli implementation…
-
Distance codes with a length of 258 are usually encoded with code 285. However, it's technically possible to encode these with code 284, as a length of 227 (base length) + 31 (extra bits). This may no…
-
Voir pour ajouter les algos :
BSD sum,
POSIX cksum
CRC-8, CRC-16, CRC-24
ELF-32
eMule/eDonkey
FCS-16
GOST R 34.11-94,
Tiger-128, Tiger-160, Tiger, Tiger2, Tiger Tree Hash, Tiger2 Tree Hash
Un…