Choose a version:
13% The original file has 464330 bytes (453.4k) and is available from the project website.
There you can find the official minified version, too, which brings down the size to 62630 bytes (61.2k, 13%).

After GZIP compression these minified files vary in size:
Boot
  37051 bytes (36.2k)
 CDN
cdnjs
  30552 bytes (29.8k)
 CDN
gzip -6 (default)
  20913 bytes (20.4k)
 local copy
gzip -9
  20852 bytes (20.4k)
 local copy
7zip -mx=9 -tgzip
  20220 bytes (19.7k)
 local copy
libdeflate -12
  20217 bytes (19.7k)
 local copy
zultra
  20156 bytes (19.7k)
 local copy
kzip -s0 -rn -b4
  20141 bytes (19.7k)
 local copy
pigz -11 -n
  20090 bytes (19.6k)
 local copy
Zopfli
  20061 bytes (19.6k)
 local copy

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

You will automatically get the smallest lodash 4.1.0 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 10491 bytes by using my lodash 4.1.0 Zopfli version instead of the best available CDN (52.30% smaller than cdnjs, 20061 vs. 30552 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 --mls2 --bsr23 --lazy --ohh

(found April 12, 2016)
Description Value Parameter
iterations 100000  --i100000
maximum blocks 8  --mb8
maximum length score 2  --mls2
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.1.0/dist/lodash.min.js --location | md5sum
2066eff5ccfc1e6197e9a20e63885bc9  -
curl --silent --compressed https://minime.stephan-brumme.com/files/lodash/lodash-4.1.0.min.zopfli.js.gz | md5sum
2066eff5ccfc1e6197e9a20e63885bc9  -

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

CDN Size (compressed) MD5 (uncompressed) Comment / Diff Timestamp
Boot 37051 bytes 6703ef98502d64e509de57912e8a9f7f < /**
< * @license
< * lodash 4.1.0 (Custom Build) lodash.com/license | Unders [...]
< * Build: `lodash -o ./dist/lodash.js`
< */
< ;(function(){function n(n,t){return n.set(t[0],t[1]),n}fun [...]
< return true}function i(n,t){for(var r=-1,e=n.length,u=-1,o [...]
< var u=n.length;for(e&&u&&(r=n[--u]);u--;)r=t(r,n[u],u,n);r [...]
< return-1}function y(n,t,r,e,u){return u(n,function(n,u,o){ [...]
< return r}function E(n,t){for(var r=n.length;r--&&-1<d(t,n[ [...]
[...]
 (invalid)
cdnjs 30552 bytes 6703ef98502d64e509de57912e8a9f7f < /**
< * @license
< * lodash 4.1.0 (Custom Build) lodash.com/license | Unders [...]
< * Build: `lodash -o ./dist/lodash.js`
< */
< ;(function(){function n(n,t){return n.set(t[0],t[1]),n}fun [...]
< return true}function i(n,t){for(var r=-1,e=n.length,u=-1,o [...]
< var u=n.length;for(e&&u&&(r=n[--u]);u--;)r=t(r,n[u],u,n);r [...]
< return-1}function y(n,t,r,e,u){return u(n,function(n,u,o){ [...]
< return r}function E(n,t){for(var r=n.length;r--&&-1<d(t,n[ [...]
[...]
 (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
20061 bytes -3 bytes zopfli --i100000 --mls2 --bsr23 --lazy --ohh April 12, 2016 @ 12:41
20064 bytes -3 bytes zopfli --i10000 --mls2 --bsr23 --lazy --ohh April 12, 2016 @ 10:53
20067 bytes -6 bytes zopfli --i1000 --mls2 --bsr23 --lazy --ohh April 12, 2016 @ 09:23
20073 bytes – zopfli --i100 --mls2 --bsr23 --lazy --ohh April 12, 2016 @ 02:36

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:43.

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 or 100,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 20101 20100 20111 20102 20115 20115 20117 20100 20112 20106 20092 20097 20106 20097 20116
4 20072 20070 20071 20076 20075 20080 20076 20081 20074 20085 20085 20091 20099 20079 20100
6 20067 20067 20076 20079 20069 20071 20076 20078 20084 20084 20084 20086 20087 20075 20075
7 20070 20067 20088 20071 20086 20071 20067 20071 20072 20070 20069 20091 20088 20074 20078
8 20067 20070 20074 20078 20068 20069 20070 20069 20075 20084 20075 20084 20084 20076 20075
9 20078 20069 20077 20078 20070 20074 20067 20070 20071 20073 20074 20091 20086 20079 20081
10 20069 20071 20080 20082 20070 20075 20072 20088 20072 20069 20069 20074 20087 20092 20072
11 20071 20072 20079 20075 20068 20071 20070 20070 20072 20065 20069 20089 20087 20078 20078
12 20073 20067 20076 20079 20069 20070 20068 20075 20073 20075 20071 20075 20086 20080 20073
13 20069 20067 20075 20074 20069 20070 20067 20068 20073 20072 20074 20085 20086 20092 20084
14 20073 20068 20074 20079 20083 20074 20069 20077 20077 20070 20075 20073 20086 20093 20076
15 20070 20067 20076 20075 20068 20074 20067 20069 20075 20071 20074 20086 20086 20075 20080
16 20068 20069 20080 20076 20067 20073 20067 20070 20073 20072 20079 20069 20088 20090 20077
17 20076 20068 20074 20076 20068 20070 20067 20075 20070 20073 20070 20075 20087 20076 20076
18 20077 20068 20071 20077 20069 20071 20069 20069 20073 20073 20075 20075 20085 20076 20072
19 20068 20071 20074 20079 20070 20070 20068 20068 20072 20076 20088 20087 20088 20077 20076
20 20073 20071 20068 20077 20076 20072 20067 20072 20071 20084 20069 20085 20084 20073 20073
21 20076 20069 20074 20077 20070 20072 20067 20073 20072 20075 20074 20091 20087 20074 20071
22 20062 20069 20074 20081 20070 20072 20069 20070 20071 20073 20075 20089 20086 20077 20083
23 20061 20067 20080 20077 20068 20071 20067 20066 20072 20082 20070 20085 20086 20082 20076
25 20069 20067 20070 20079 20068 20075 20068 20070 20073 20085 20084 20070 20087 20092 20072
30 20073 20068 20072 20079 20075 20078 20070 20071 20073 20071 20076 20072 20087 20077 20073
40 20074 20070 20079 20078 20074 20071 20068 20069 20073 20075 20080 20085 20086 20077 20077

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 20073 bytes – 100%
1,000 20067 bytes -6 bytes 100%
10,000 20064 bytes -3 bytes 100%
100,000 20061 bytes -3 bytes 0.58%
1,000,000 – – –
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) 20154 bytes +93 bytes (+0.46%) +13 bytes
1 20218 bytes +157 bytes (+0.78%) +77 bytes
2 20145 bytes +84 bytes (+0.42%) +4 bytes
3 20156 bytes +95 bytes (+0.47%) +15 bytes
4 20141 bytes +80 bytes (+0.40%) –
5 20154 bytes +93 bytes (+0.46%) +13 bytes
6 20176 bytes +115 bytes (+0.57%) +35 bytes
7 20200 bytes +139 bytes (+0.69%) +59 bytes
8 20211 bytes +150 bytes (+0.75%) +70 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 17095 bytes -2966 bytes (-14.78%)
RAR (proprietary) RAR rar a -m5 -md64m -mc63:128t -mt1 17340 bytes -2721 bytes (-13.56%)
PPMd (Wikipedia) 7zip 7za a -mx=9 -m0=ppmd 18387 bytes -1674 bytes (-8.34%)
Brotli (Wikipedia) brotli brotli -q 11 18959 bytes -1102 bytes (-5.49%)
LZMA2 (Wikipedia) xz xz -9 19344 bytes -717 bytes (-3.57%)
Burrows-Wheeler transform (Wikipedia) bzip2 bzip2 -9 19454 bytes -607 bytes (-3.03%)
Zstandard (Wikipedia) zstd zstd -19 19964 bytes -97 bytes (-0.48%)

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.