Zstd
Appearance
![]() | |
Original author(s) | Yann Collet |
---|---|
Developer(s) | Yann Collet, Przemysław Skibiński (inikep) |
Initial release | January 24, 2015 |
Stable release | 1.2.0
/ May 5, 2017[1] |
Repository | |
Written in | C |
Operating system | Cross-platform |
Platform | Portable |
Type | Data compression |
License | BSD License |
Website | facebook |
Zstandard (or Zstd) is a lossless data compression algorithm developed by Yann Collet at Facebook. The name also refers to the reference implementation in C. Version 1 of implementation was released as free software on 31 August 2016.[2][3]
Features
Zstandard was designed to give compression comparable to that of DEFLATE (.ZIP, gzip) with higher compression / decompression speeds.
Zstandard combines use of a dictionary-type algorithm (LZ77) and Finite State Entropy (tANS) stage of entropy coding.
License
The reference implementation is licensed under the BSD License, published at GitHub. Since version 1.0, it has additional Grant of Patent Rights.[4]
See also
- Brotli
- LZFSE - A similar algorithm by Apple used since iOS 9 and OS X 10.11 and made open-source on 1 June 2016
References
- ^ "Releases - facebook/zstd". Retrieved 5 May 2017 – via GitHub.
- ^ Sergio De Simone, Facebook Open-Sources New Compression Algorithm Outperforming Zlib / InfoQ, Sep 02, 2016
- ^ "Life imitates satire: Facebook touts zlib killer just like Silicon Valley's Pied Piper". The Register. 2016-08-31. Retrieved 2016-09-06.
- ^ zstd/PATENTS "Additional Grant of Patent Rights Version 2", Facebook
External links
- Official website
- zstd on GitHub
- "Smaller and faster data compression with Zstandard", Yann Collet and Chip Turner, 31 August 2016, Facebook Announcement
- The Guardian is using ZStandard instead of zlib
![]() | You can help expand this article with text translated from the corresponding article in French. (September 2016) Click [show] for important translation instructions.
|
![]() | You can help expand this article with text translated from the corresponding article in Russian. (September 2016) Click [show] for important translation instructions.
|