lodash 4.17.2 - as small as it gets (near-perfect GZIP compression)

Choose a version:

The original file has 538744 bytes (526.1k) and is available from the project website.
There you can find the official minified version, too, which brings down the size to 72690 bytes (71.0k, 13%).

After GZIP compression these minified files vary in size:

Boot	28680 bytes (28.0k)	CDN
cdnjs	25573 bytes (25.0k)	CDN
unpkg	24252 bytes (23.7k)	CDN
gzip -6 (default)	24208 bytes (23.6k)	local copy
jsdelivr	24152 bytes (23.6k)	CDN
gzip -9	24151 bytes (23.6k)	local copy
7zip -mx=9 -tgzip	23314 bytes (22.8k)	local copy
libdeflate -12	23311 bytes (22.8k)	local copy
zultra	23271 bytes (22.7k)	local copy
kzip -s0 -rn -b3	23227 bytes (22.7k)	local copy
pigz -11 -n	23199 bytes (22.7k)	local copy
Zopfli	23157 bytes (22.6k)	local copy

perma-link to the smallest file on my server:
http://minime.stephan-brumme.com/files/lodash/lodash-4.17.2.min.js (or via HTTPS)

You will automatically get the smallest lodash 4.17.2 file, ETag caching is available and
if your browser doesn't support GZIP decompression then the uncompressed version will be sent.

Currently best Zopfli settings

Save 995 bytes by using my lodash 4.17.2 Zopfli version instead of the best available CDN (4.30% smaller than jsdelivr, 23157 vs. 24152 bytes):

Download

You can use my super-compressed files for whatever purpose you like as long as you respect the library's original license agreement.
There are no restrictions from my side - but please avoid hot-linking if you run a high-traffic website.

These command-line settings yielded the best compression ratio so far (Linux version of zopfli-krzymod):
zopfli --i100000 --mb8 --mls4 --bsr23 --lazy --ohh

(found November 16, 2016)

Description	Value	Parameter
iterations	100000	--i100000
maximum blocks	8	--mb8
maximum length score	4	--mls4
block splitting recursion	23	--bsr23
lazy matching in LZ77	yes	--lazy
optimized Huffman headers	yes	--ohh
initial random W for iterations	1	--rw1
initial random Z for iterations	2	--rz2

Verify file integrity

After decompression, my uncompressed files are identical to the original ones:

MD5:
curl --silent --compressed https://raw.githubusercontent.com/lodash/lodash/4.17.2/dist/lodash.min.js --location | md5sum
914258a312cebd3f99962ae2a2ffb053 -
curl --silent --compressed https://minime.stephan-brumme.com/files/lodash/lodash-4.17.2.min.zopfli.js.gz | md5sum
914258a312cebd3f99962ae2a2ffb053 -

SHA1:
curl --silent --compressed https://raw.githubusercontent.com/lodash/lodash/4.17.2/dist/lodash.min.js --location | sha1sum
71e4cf088a649c6c0988635b0acb34186f66f340 -
curl --silent --compressed https://minime.stephan-brumme.com/files/lodash/lodash-4.17.2.min.zopfli.js.gz | sha1sum
71e4cf088a649c6c0988635b0acb34186f66f340 -

These CDNs send you the original file:

CDN	Size (compressed)	MD5 (uncompressed)	Timestamp
unpkg	24252 bytes	914258a312cebd3f99962ae2a2ffb053	November 16, 2016 @ 08:51
jsdelivr	24152 bytes	914258a312cebd3f99962ae2a2ffb053	(invalid)

And some CDNs send you a different file:

CDN	Size (compressed)	MD5 (uncompressed)	Comment / Diff	Timestamp
Boot	28680 bytes	9faabe7d2ed948ffc7c88876dbcc8c9e	< /** < * @license < * Lodash lodash.com/license \| Underscore.js 1.8.3 undersc [...] < */ < ;(function(){function n(n,t){return n.set(t[0],t[1]),n}fun [...] < return n}function o(n,t){for(var r=-1,e=null==n?0:n.length [...] < return n}function h(n,t,r,e){var u=-1,i=null==n?0:n.length [...] < --r;for(var e=n.length;++r<e;)if(n[r]===t){n=r;break n}n=- [...] < return n}function k(n,t){for(var r,e=-1,u=n.length;++e<u;) [...] < return"\\"+Tn[n]}function L(n){var t=-1,r=Array(n.size);re [...] [...]	November 17, 2016 @ 11:38
cdnjs	25573 bytes	9faabe7d2ed948ffc7c88876dbcc8c9e	< /** < * @license < * Lodash lodash.com/license \| Underscore.js 1.8.3 undersc [...] < */ < ;(function(){function n(n,t){return n.set(t[0],t[1]),n}fun [...] < return n}function o(n,t){for(var r=-1,e=null==n?0:n.length [...] < return n}function h(n,t,r,e){var u=-1,i=null==n?0:n.length [...] < --r;for(var e=n.length;++r<e;)if(n[r]===t){n=r;break n}n=- [...] < return n}function k(n,t){for(var r,e=-1,u=n.length;++e<u;) [...] < return"\\"+Tn[n]}function L(n){var t=-1,r=Array(n.size);re [...] [...]	(invalid)

Note: only the MD5 hashes are shown to keep things simple.

Other Versions

Available lodash versions at minime.stephan-brumme.com:

4.17.21, 4.17.20, 4.17.19, 4.17.18, 4.17.17, 4.17.16, 4.17.15, 4.17.14, 4.17.13, 4.17.12, 4.17.11, 4.17.10, 4.17.9, 4.17.5, 4.17.4, 4.17.3, 4.17.2, 4.17.1, 4.17.0, 4.16.6, 4.16.5, 4.16.4, 4.16.3, 4.16.2, 4.16.1, 4.16.0, 4.15.0, 4.14.2, 4.14.1, 4.14.0, 4.13.1, 4.13.0, 4.12.0, 4.11.2, 4.11.1, 4.11.0, 4.10.0,
4.9.0, 4.8.2, 4.8.1, 4.8.0, 4.7.0, 4.6.1, 4.6.0, 4.5.1, 4.5.0, 4.4.0, 4.3.0, 4.2.1, 4.2.0, 4.1.0, 4.0.1, 4.0.0

The project site contains an overview how well these versions were compressed.
Other interesting projects are AngularJS, BackboneJS, Bootstrap, D3, Dojo, Ember, jQuery, Knockout, React, Socket.IO, ThreeJS, UnderscoreJS and Vue.

Changelog

Best Zopfli parameters so far:

Size	Improvement	Parameters	Found
23157 bytes	-2 bytes	zopfli --i100000 --mls4 --bsr23 --lazy --ohh	November 16, 2016 @ 09:47
23159 bytes	-2 bytes	zopfli --i10000 --mls4 --bsr23 --lazy --ohh	November 16, 2016 @ 09:04
23161 bytes	-3 bytes	zopfli --i10000 --mls1024 --bsr8 --lazy --ohh	November 16, 2016 @ 08:59
23164 bytes	-1 byte	zopfli --i1000 --mls1024 --bsr8 --lazy --ohh	November 16, 2016 @ 08:55
23165 bytes	-1 byte	zopfli --i1000 --mls4 --bsr23 --lazy --ohh	November 16, 2016 @ 08:55
23166 bytes	-1 byte	zopfli --i1000 --mls8 --bsr11 --lazy --ohh	November 16, 2016 @ 08:55
23167 bytes	-5 bytes	zopfli --i1000 --mls1024 --bsr7 --lazy --ohh	November 16, 2016 @ 08:54
23172 bytes	–	zopfli --i100 --mls1024 --bsr7 --lazy --ohh	November 16, 2016 @ 08:52

If there are multiple parameter sets yielding the same compressed size, only the first one found is shown.

Most recent activity on July 20, 2020 @ 12:50.

Heatmaps

This Zopfli heatmap visualizes how compression changes when modifying the --bsr and --mls parameter.
Cell's contents is the best filesize achieved (in bytes, hover with mouse over cells to see number of iterations).

Good parameters are green, bad are red. The best and worst are bold as well.
The brightness of the blue background color indicates how many iterations were processed:
10,000, 100,000 or 1,000,000.

bsr \ mls	2	4	8	16	32	64	128	256	512	1024	2048	4096	8192	16384	32768
bsr \ mls	2	4	8	16	32	64	128	256	512	1024	2048	4096	8192	16384	32768
2	23214	23219	23212	23196	23206	23210	23197	23202	23201	23206	23209	23204	23206	23217	23211
4	23183	23202	23202	23229	23204	23185	23200	23185	23182	23185	23184	23193	23186	23211	23191
6	23183	23169	23182	23182	23172	23173	23173	23163	23175	23164	23172	23173	23165	23187	23180
7	23180	23163	23168	23177	23171	23171	23181	23178	23179	23160	23177	23171	23180	23181	23193
8	23178	23173	23160	23171	23187	23171	23184	23184	23181	23160	23176	23170	23186	23193	23184
9	23190	23172	23171	23170	23179	23171	23160	23178	23181	23171	23185	23185	23193	23186	23194
10	23173	23171	23172	23171	23181	23177	23168	23178	23178	23178	23176	23172	23163	23192	23170
11	23179	23161	23163	23170	23175	23183	23172	23160	23176	23160	23187	23186	23186	23188	23185
12	23179	23170	23158	23171	23170	23170	23174	23179	23174	23170	23171	23169	23172	23186	23171
13	23179	23170	23163	23171	23170	23182	23163	23194	23177	23163	23165	23172	23171	23185	23170
14	23192	23173	23160	23171	23169	23171	23174	23185	23173	23169	23173	23171	23171	23184	23185
15	23180	23172	23171	23170	23178	23171	23180	23180	23173	23169	23172	23172	23177	23181	23170
16	23183	23170	23171	23176	23184	23184	23178	23177	23174	23169	23177	23173	23171	23182	23185
17	23174	23170	23170	23171	23178	23172	23165	23168	23176	23161	23172	23170	23171	23185	23170
18	23175	23174	23171	23183	23168	23172	23173	23181	23178	23166	23176	23170	23172	23187	23188
19	23189	23161	23170	23171	23195	23171	23160	23168	23175	23160	23189	23173	23188	23184	23182
20	23171	23170	23164	23170	23179	23171	23180	23179	23175	23163	23175	23185	23190	23190	23171
21	23170	23174	23172	23170	23172	23171	23164	23171	23176	23166	23171	23171	23171	23185	23170
22	23170	23172	23163	23172	23176	23170	23174	23179	23173	23160	23173	23159	23172	23185	23186
23	23171	23157	23160	23170	23170	23170	23159	23183	23174	23171	23159	23174	23172	23187	23173
25	23179	23172	23170	23170	23172	23171	23163	23169	23186	23161	23160	23180	23173	23186	23187
30	23208	23163	23171	23170	23170	23171	23165	23180	23178	23161	23163	23172	23172	23185	23185
40	23172	23175	23177	23164	23182	23170	23166	23178	23175	23173	23165	23173	23171	23186	23186

Due to the Monte Carlo design of my search algorithm, not all parameters have reached the same number of iterations yet:

Iterations	Min. Bytes	Reduction	Coverage
100	23172 bytes	–	100%
1,000	23164 bytes	-8 bytes	100%
10,000	23159 bytes	-5 bytes	100%
100,000	23157 bytes	-2 bytes	6.38%
1,000,000	23157 bytes	–	0.29%
10,000,000	–	–	–

KZIP has far less options available for tuning/optimization. I only played around with the number of blocks (parameter -n):

Blocks	Min. Bytes	Compared To Best Zopfli	Compared To Best KZIP
(any)	23255 bytes	+98 bytes (+0.42%)	+28 bytes
1	23413 bytes	+256 bytes (+1.11%)	+186 bytes
2	23289 bytes	+132 bytes (+0.57%)	+62 bytes
3	23227 bytes	+70 bytes (+0.30%)	–
4	23250 bytes	+93 bytes (+0.40%)	+23 bytes
5	23257 bytes	+100 bytes (+0.43%)	+30 bytes
6	23239 bytes	+82 bytes (+0.35%)	+12 bytes
7	23259 bytes	+102 bytes (+0.44%)	+32 bytes
8	23281 bytes	+124 bytes (+0.54%)	+54 bytes

Non-DEFLATE Algorithms

Archivers based on completely different compression algorithms often produce superior results.
Unfortunately, browsers only support gzip compression at the moment.
However, support for Brotli is constantly growing - for example, your browser actually supports it !

Algorithm	Program	Parameters	Size	Compared To Best Zopfli
ZPAQ (Wikipedia)	zpaq	zpaq -method 69	19460 bytes	-3697 bytes (-15.96%)
RAR (proprietary)	RAR	rar a -m5 -md64m -mc63:128t -mt1	20098 bytes	-3059 bytes (-13.21%)
PPMd (Wikipedia)	7zip	7za a -mx=9 -m0=ppmd	20913 bytes	-2244 bytes (-9.69%)
Brotli (Wikipedia)	brotli	brotli -q 11	21661 bytes	-1496 bytes (-6.46%)
LZMA2 (Wikipedia)	xz	xz -9	22168 bytes	-989 bytes (-4.27%)
Burrows-Wheeler transform (Wikipedia)	bzip2	bzip2 -9	22514 bytes	-643 bytes (-2.78%)
Zstandard (Wikipedia)	zstd	zstd -19	23040 bytes	-117 bytes (-0.51%)

Detailled Analysis

I wrote a DEFLATE decoder in Javascript. Click the button below to start a client-side analysis of the smallest gzipped files (may take a second):

Load and Parse Data

Notes: pigz is a fast open source multi-threaded implementation of gzip written by one of the original authors of gzip.
However, when using compression level 11, pigz actually switches to the slower Zopfli algorithm and isn't multi-threaded anymore.
KrzyMOD's extensions to Zopfli offer the highest level of configuration and is therefore used for my brute-force search.
Ken Silverman wrote the closed-source KZIP compression program and Jonathon Fowler ported it to Linux.
Defluff was created by Joachim Henke; DeflOpt is a tool by Ben Jos Walbeehm.

website made by Stephan Brumme in 2015 and still improving in 2025.
all timestamps are displayed in central european time. see my changelog.
no flash, not even images or external css files - and everything squeezed into a single html file.
which was handsomely compressed before releasing it into the wild internet - obviously.

please visit my homepage and my blog, too.
email: minime (at) stephan-brumme.com

All trademarks are property of their respective owners. You know, the boring legal stuff.