Choose a version:
14% The original file has 469225 bytes (458.2k) and is available from the project website.
There you can find the official minified version, too, which brings down the size to 63530 bytes (62.0k, 14%).

After GZIP compression these minified files vary in size:
Boot
  37402 bytes (36.5k)
CDN
cdnjs
  30831 bytes (30.1k)
CDN
gzip -6 (default)
  21146 bytes (20.7k)
local copy
jsdelivr
  21067 bytes (20.6k)
CDN
gzip -9
  21061 bytes (20.6k)
local copy
7zip -mx=9 -tgzip
  20437 bytes (20.0k)
local copy
libdeflate -12
  20425 bytes (19.9k)
local copy
kzip -s0 -rn -b2
  20354 bytes (19.9k)
local copy
zultra
  20354 bytes (19.9k)
local copy
pigz -11 -n
  20295 bytes (19.8k)
local copy
Zopfli
  20266 bytes (19.8k)
local copy
Zopfli (defluff)
  20265 bytes (19.8k)
local copy

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

You will automatically get the smallest lodash 4.3.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 801 bytes by using my lodash 4.3.0 Zopfli version instead of the best available CDN (3.95% smaller than jsdelivr, 20266 vs. 21067 bytes):
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 --mls1024 --bsr13 --lazy --ohh

(found April 17, 2016)
Description Value Parameter
iterations 100000  --i100000
maximum blocks 8  --mb8
maximum length score 1024  --mls1024
block splitting recursion 13  --bsr13
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

Even Smaller Files Thanks To Defluff

Zopfli's output can be further optimized by the defluff tool.
In this particular case, defluff saves 1 more byte (20265 bytes).

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.3.0/dist/lodash.min.js --location | md5sum
cd62e1be6d9e350192d1d9cd6e1db4ff  -
curl --silent --compressed https://minime.stephan-brumme.com/files/lodash/lodash-4.3.0.min.zopfli.js.gz | md5sum
cd62e1be6d9e350192d1d9cd6e1db4ff  -

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

These CDNs send you the original file:
CDN Size (compressed) MD5 (uncompressed) Timestamp
jsdelivr 21067 bytes cd62e1be6d9e350192d1d9cd6e1db4ff (invalid)

And some CDNs send you a different file:
CDN Size (compressed) MD5 (uncompressed) Comment / Diff Timestamp
Boot 37402 bytes 7f25b6ec0d6a5420e60aea44ba7fdff2 < /**
< * @license
< * lodash 4.3.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 k(n,t){for(var r=n.length;r--&&-1<d(t,n[ [...]
[...]
(invalid)
cdnjs 30831 bytes 7f25b6ec0d6a5420e60aea44ba7fdff2 < /**
< * @license
< * lodash 4.3.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 k(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
20266 bytes -2 bytes zopfli --i100000 --mls1024 --bsr13 --lazy --ohh April 17, 2016 @ 14:40
20268 bytes -1 byte zopfli --i100000 --mls128 --bsr16 --lazy --ohh April 13, 2016 @ 15:22
20269 bytes -2 bytes zopfli --i100000 --mls128 --bsr15 --lazy --ohh April 13, 2016 @ 14:26
20271 bytes -1 byte zopfli --i10000 --mls128 --bsr16 --lazy --ohh April 12, 2016 @ 18:32
20272 bytes -3 bytes zopfli --i10000 --mls512 --bsr10 --lazy --ohh April 12, 2016 @ 15:58
20275 bytes -4 bytes zopfli --i1000 --mls512 --bsr10 --lazy --ohh April 12, 2016 @ 15:55
20279 bytes zopfli --i100 --mls512 --bsr10 --lazy --ohh April 12, 2016 @ 02:45

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

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
20303 20305 20304 20321 20323 20313 20325 20308 20279 20299 20299 20290 20289 20300 20320
20283 20283 20289 20287 20285 20286 20284 20286 20292 20292 20285 20302 20290 20297 20298
20273 20273 20286 20273 20278 20286 20281 20283 20282 20280 20280 20298 20296 20301 20289
20272 20275 20278 20287 20276 20273 20269 20273 20274 20274 20289 20295 20276 20282 20283
20277 20272 20280 20284 20287 20277 20269 20273 20273 20279 20279 20296 20275 20292 20277
20275 20282 20291 20281 20276 20294 20274 20272 20275 20290 20287 20297 20296 20288 20276
20273 20274 20283 20284 20280 20280 20275 20278 20272 20272 20272 20272 20281 20291 20281
20272 20277 20281 20281 20280 20277 20273 20274 20276 20273 20271 20295 20277 20304 20284
20276 20276 20286 20282 20276 20275 20274 20275 20272 20279 20292 20294 20278 20290 20285
20274 20274 20285 20272 20276 20277 20272 20274 20272 20266 20285 20295 20299 20304 20282
20272 20272 20288 20273 20276 20275 20271 20274 20272 20291 20278 20294 20277 20285 20278
20272 20274 20286 20274 20274 20277 20269 20271 20272 20290 20278 20294 20276 20289 20285
20276 20276 20281 20285 20275 20277 20268 20273 20270 20271 20279 20298 20275 20288 20279
20275 20274 20286 20283 20275 20272 20273 20272 20274 20273 20274 20296 20272 20285 20280
20273 20278 20285 20285 20279 20277 20273 20272 20273 20276 20271 20278 20269 20285 20285
20283 20271 20284 20281 20275 20273 20273 20273 20276 20270 20292 20296 20295 20279 20277
20273 20274 20284 20284 20274 20278 20275 20286 20274 20274 20293 20277 20293 20276 20277
20273 20274 20287 20273 20277 20280 20274 20274 20274 20285 20292 20293 20276 20293 20279
20274 20274 20287 20282 20275 20274 20272 20272 20271 20291 20291 20279 20279 20282 20279
20273 20274 20286 20282 20276 20277 20272 20272 20273 20291 20271 20297 20275 20293 20276
20272 20274 20286 20283 20277 20276 20273 20273 20273 20281 20291 20289 20273 20287 20281
20274 20275 20286 20286 20274 20279 20277 20279 20274 20290 20286 20298 20298 20280 20278
20277 20275 20287 20286 20278 20277 20274 20274 20271 20274 20293 20297 20293 20282 20281

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 20279 bytes 100%
1,000 20274 bytes -5 bytes 100%
10,000 20269 bytes -5 bytes 100%
100,000 20266 bytes -3 bytes 1.74%
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
20362 bytes +96 bytes (+0.47%) +8 bytes
20428 bytes +162 bytes (+0.80%) +74 bytes
20354 bytes +88 bytes (+0.43%)
20365 bytes +99 bytes (+0.49%) +11 bytes
20361 bytes +95 bytes (+0.47%) +7 bytes
20372 bytes +106 bytes (+0.52%) +18 bytes
20390 bytes +124 bytes (+0.61%) +36 bytes
20406 bytes +140 bytes (+0.69%) +52 bytes
20419 bytes +153 bytes (+0.75%) +65 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 - but your browser doesn't support it.
Algorithm Program Parameters Size Compared To Best Zopfli
ZPAQ (Wikipedia) zpaq zpaq -method 69 17185 bytes -3081 bytes (-15.20%)
RAR (proprietary) RAR rar a -m5 -md64m -mc63:128t -mt1 17502 bytes -2764 bytes (-13.64%)
PPMd (Wikipedia) 7zip 7za a -mx=9 -m0=ppmd 18604 bytes -1662 bytes (-8.20%)
Brotli (Wikipedia) brotli brotli -q 11 19153 bytes -1113 bytes (-5.49%)
LZMA2 (Wikipedia) xz xz -9 19552 bytes -714 bytes (-3.52%)
Burrows-Wheeler transform (Wikipedia) bzip2 bzip2 -9 19603 bytes -663 bytes (-3.27%)
Zstandard (Wikipedia) zstd zstd -19 20169 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):


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 2024.
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.