Jump to content

LZ4 (compression algorithm): Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

12 February 2024

30 May 2023

15 April 2023

31 January 2023

24 January 2023

16 December 2022

3 September 2022

6 February 2022

15 November 2021

8 November 2021

  • curprev 14:1014:10, 8 November 20212a02:168:65fc:0:503e:a111:6f33:7b9e talk 6,840 bytes −12 Make the wording clearer. The Phoronix source shows that worse compression ratio but higher better decompression speed than LZO is typical. Of course, that might not be universally true, but I don't think we need to go into that much detail in this summary section. undo

6 October 2021

31 March 2021

6 March 2021

5 March 2021

25 January 2021

15 January 2021

5 January 2021

7 October 2020

21 September 2020

6 September 2020

9 July 2020

  • curprev 13:2913:29, 9 July 2020TheAntiDisruptor talk contribs 5,932 bytes +650 →‎Design: This is a key design decision, as entropy coding is a lot of work. Not doing that work obviously allows LZ4 to be much simpler and faster (with potentially much worse compression ratio if entropy coding is very beneficial, which depends on the data being compressed). I used Huffman coding in DEFLATE as an example, as DEFLATE is already used in the performance comparison in the previous section, and it's extreme commonness makes it the natural neutral choice for such comparisons. undo

30 September 2019

20 September 2019

19 September 2019

7 September 2019

30 August 2019

28 July 2019

24 March 2019

26 December 2018

17 October 2018

26 September 2018

9 May 2018

24 January 2018

4 January 2018

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)