Choose a version:
27% The original file has 1612209 bytes (1,574.4k) and is available from the project website.
There you can find the official minified version, too, which brings down the size to 432215 bytes (422.1k, 27%).

After GZIP compression these minified files vary in size:
Boot
  136397 bytes (133.2k)
CDN
gzip -6 (default)
  110535 bytes (107.9k)
local copy
cdnhttps
  110266 bytes (107.7k)
CDN
cdnjs
  110266 bytes (107.7k)
CDN
gzip -9
  110156 bytes (107.6k)
local copy
7zip -mx=9 -tgzip
  106546 bytes (104.0k)
local copy
libdeflate -12
  106469 bytes (104.0k)
local copy
pigz -11 -n
  106355 bytes (103.9k)
local copy
kzip -s0 -rn -b4
  106160 bytes (103.7k)
local copy
Zopfli
  106098 bytes (103.6k)
local copy
Zopfli (defluff)
  106095 bytes (103.6k)
local copy

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

You will automatically get the smallest Ember 2.0.3 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 4168 bytes by using my Ember 2.0.3 Zopfli version instead of the best available CDN (3.93% smaller than cdnjs, 106098 vs. 110266 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 --mls64 --bsr30 --lazy --ohh

(found January 26, 2016)
Description Value Parameter
iterations 100000  --i100000
maximum blocks 8  --mb8
maximum length score 64  --mls64
block splitting recursion 30  --bsr30
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 3 more bytes (106095 bytes).

Verify file integrity

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

MD5:
curl --silent --compressed https://builds.emberjs.com/tags/v2.0.3/ember.min.js --location | md5sum
04266452aff52be220af7f7df53f7e55  -
curl --silent --compressed https://minime.stephan-brumme.com/files/ember/ember-2.0.3.min.zopfli.js.gz | md5sum
04266452aff52be220af7f7df53f7e55  -

SHA1:
curl --silent --compressed https://builds.emberjs.com/tags/v2.0.3/ember.min.js --location | sha1sum
fdf62d7d99f7635d544b8c239a377c3ff7d762da  -
curl --silent --compressed https://minime.stephan-brumme.com/files/ember/ember-2.0.3.min.zopfli.js.gz | sha1sum
fdf62d7d99f7635d544b8c239a377c3ff7d762da  -

CDN Size (compressed) MD5 (uncompressed) Comment / Diff Timestamp
Boot 136397 bytes a9c1018ac07bf7644b3f2e2589a74bb2 < !function(){var e,t,r,n,i,a=this;!function(){function a(e, [...]
< if(t in e)i=t,r="prop";else{var a=t.toLowerCase();a in e?( [...]
< "use strict";function r(e,r){return t.isStream(e)?e.getKey [...]
< return e.appendChild(t,r),t},buildRenderNodes:function(e,t [...]
< var r=s.meta(e);r.watching[t]&&l.removeDependentKeys(this, [...]
< e}function R(e){for(var t=arguments.length,r=Array(t>1?t-1 [...]
< var a;return a=n.length>0?function(){var a=n;if(arguments. [...]
< if(r){var n=b.calculateCacheKey(r.prefix||"",r.parts,r.val [...]
< return this.objectAt(0)}),lastObject:n.computed(function() [...]
< return N.get(e)}var p=/[ _]/g,v=new i["default"](1e3,funct [...]
[...]
January 16, 2016 @ 15:01
cdnhttps 110266 bytes a9c1018ac07bf7644b3f2e2589a74bb2 < !function(){var e,t,r,n,i,a=this;!function(){function a(e, [...]
< if(t in e)i=t,r="prop";else{var a=t.toLowerCase();a in e?( [...]
< "use strict";function r(e,r){return t.isStream(e)?e.getKey [...]
< return e.appendChild(t,r),t},buildRenderNodes:function(e,t [...]
< var r=s.meta(e);r.watching[t]&&l.removeDependentKeys(this, [...]
< e}function R(e){for(var t=arguments.length,r=Array(t>1?t-1 [...]
< var a;return a=n.length>0?function(){var a=n;if(arguments. [...]
< if(r){var n=b.calculateCacheKey(r.prefix||"",r.parts,r.val [...]
< return this.objectAt(0)}),lastObject:n.computed(function() [...]
< return N.get(e)}var p=/[ _]/g,v=new i["default"](1e3,funct [...]
[...]
November 22, 2016 @ 16:33
cdnjs 110266 bytes a9c1018ac07bf7644b3f2e2589a74bb2 < !function(){var e,t,r,n,i,a=this;!function(){function a(e, [...]
< if(t in e)i=t,r="prop";else{var a=t.toLowerCase();a in e?( [...]
< "use strict";function r(e,r){return t.isStream(e)?e.getKey [...]
< return e.appendChild(t,r),t},buildRenderNodes:function(e,t [...]
< var r=s.meta(e);r.watching[t]&&l.removeDependentKeys(this, [...]
< e}function R(e){for(var t=arguments.length,r=Array(t>1?t-1 [...]
< var a;return a=n.length>0?function(){var a=n;if(arguments. [...]
< if(r){var n=b.calculateCacheKey(r.prefix||"",r.parts,r.val [...]
< return this.objectAt(0)}),lastObject:n.computed(function() [...]
< return N.get(e)}var p=/[ _]/g,v=new i["default"](1e3,funct [...]
[...]
(invalid)

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

Other Versions

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

3.0.0,
2.18.2, 2.18.1, 2.18.0,
2.17.2, 2.17.1, 2.17.0,
2.16.2, 2.16.1, 2.16.0,
2.15.3, 2.15.2, 2.15.1, 2.15.0,
2.14.1, 2.14.0,
2.13.4, 2.13.3, 2.13.2, 2.13.1, 2.13.0,
2.12.2, 2.12.1, 2.12.0,
2.11.3, 2.11.2, 2.11.1, 2.11.0,
2.10.2, 2.10.1, 2.10.0,
2.9.1, 2.9.0,
2.8.3, 2.8.2, 2.8.1, 2.8.0,
2.7.3, 2.7.2, 2.7.1, 2.7.0,
2.6.2, 2.6.1, 2.6.0,
2.5.1, 2.5.0,
2.4.6, 2.4.5, 2.4.4, 2.4.3, 2.4.2, 2.4.1, 2.4.0,
2.3.1, 2.3.0,
2.2.2, 2.2.1, 2.2.0,
2.1.2, 2.1.1, 2.1.0,
2.0.3, 2.0.2, 2.0.1, 2.0.0,
1.13.13, 1.13.12, 1.13.11, 1.13.10, 1.13.9, 1.13.8, 1.13.7, 1.13.6, 1.13.5, 1.13.4, 1.13.3, 1.13.2, 1.13.1, 1.13.0,
1.12.2, 1.12.1, 1.12.0,
1.11.4, 1.11.3, 1.11.2, 1.11.1, 1.11.0,
1.10.1, 1.10.0,
1.9.1, 1.9.0,
1.8.1, 1.8.0,
1.7.1, 1.7.0,
1.6.1, 1.6.0,
1.5.1, 1.5.0,
1.4.0,
1.3.2, 1.3.1, 1.3.0,
1.2.2, 1.2.1, 1.2.0,
1.0.1, 1.0.0

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

Changelog

Best Zopfli parameters so far:
Size Improvement Parameters Found
106098 bytes -9 bytes zopfli --i100000 --mls64 --bsr30 --lazy --ohh January 26, 2016 @ 18:03
106107 bytes -2 bytes zopfli --i10000 --mls64 --bsr30 --lazy --ohh January 25, 2016 @ 10:33
106109 bytes -5 bytes zopfli --i10000 --mls64 --bsr18 --lazy --ohh January 25, 2016 @ 09:58
106114 bytes -2 bytes zopfli --i1000 --mls64 --bsr18 --lazy --ohh January 25, 2016 @ 09:33
106116 bytes -29 bytes zopfli --i1000 --mls64 --bsr11 --lazy --ohh January 25, 2016 @ 09:32
106145 bytes zopfli --i100 --mls64 --bsr11 --lazy --ohh January 25, 2016 @ 08:42

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

Most recent activity on November 22, 2016 @ 16:33.

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
106264 106215 106272 106271 106270 106284 106271 106271 106271 106270 106274 106264 106268 106266 106262
106167 106154 106189 106143 106135 106137 106135 106134 106135 106125 106172 106262 106257 106147 106263
106269 106176 106171 106142 106129 106134 106165 106134 106129 106137 106161 106170 106175 106130 106144
106140 106179 106178 106147 106125 106128 106131 106135 106127 106203 106130 106170 106131 106123 106149
106184 106153 106174 106149 106134 106115 106144 106121 106144 106185 106141 106263 106270 106258 106258
106165 106138 106145 106142 106126 106126 106138 106143 106137 106153 106134 106268 106257 106258 106257
106134 106134 106136 106134 106133 106127 106163 106149 106140 106151 106134 106274 106257 106257 106251
106171 106173 106169 106176 106118 106101 106128 106157 106132 106147 106161 106151 106253 106257 106256
106143 106150 106113 106127 106136 106136 106163 106140 106136 106149 106134 106168 106167 106257 106252
106135 106164 106160 106142 106175 106127 106127 106133 106173 106175 106162 106133 106254 106258 106256
106139 106161 106141 106149 106174 106101 106163 106135 106143 106175 106134 106161 106253 106254 106252
106151 106168 106178 106148 106172 106126 106127 106147 106177 106173 106133 106164 106253 106255 106257
106132 106160 106177 106145 106174 106126 106162 106139 106140 106148 106148 106137 106254 106255 106256
106165 106151 106149 106146 106143 106127 106149 106136 106140 106177 106163 106180 106135 106257 106251
106142 106166 106148 106144 106138 106102 106154 106127 106139 106180 106138 106143 106257 106258 106257
106132 106150 106142 106144 106142 106112 106125 106146 106159 106183 106137 106134 106254 106258 106257
106130 106167 106143 106142 106139 106118 106139 106148 106144 106178 106142 106262 106257 106257 106252
106129 106165 106141 106142 106142 106103 106137 106141 106144 106177 106140 106272 106253 106256 106253
106135 106139 106150 106145 106134 106105 106141 106140 106145 106175 106134 106139 106138 106258 106252
106156 106148 106141 106146 106142 106125 106136 106154 106129 106153 106137 106146 106257 106257 106252
106142 106161 106142 106147 106174 106131 106128 106142 106136 106128 106268 106144 106253 106257 106256
106136 106163 106145 106148 106139 106098 106127 106137 106145 106179 106162 106162 106165 106255 106252
106157 106157 106147 106171 106173 106121 106161 106146 106126 106174 106176 106165 106261 106258 106256

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 106145 bytes 100%
1,000 106114 bytes -31 bytes 100%
10,000 106107 bytes -7 bytes 100%
100,000 106098 bytes -9 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
106175 bytes +77 bytes (+0.07%) +15 bytes
106276 bytes +178 bytes (+0.17%) +116 bytes
106307 bytes +209 bytes (+0.20%) +147 bytes
106261 bytes +163 bytes (+0.15%) +101 bytes
106160 bytes +62 bytes (+0.06%)
106168 bytes +70 bytes (+0.07%) +8 bytes
106223 bytes +125 bytes (+0.12%) +63 bytes
106254 bytes +156 bytes (+0.15%) +94 bytes
106306 bytes +208 bytes (+0.20%) +146 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 72877 bytes -33221 bytes (-31.31%)
RAR (proprietary) RAR rar a -m5 -md64m -mc63:128t -mt1 77990 bytes -28108 bytes (-26.49%)
PPMd (Wikipedia) 7zip 7za a -mx=9 -m0=ppmd 83699 bytes -22399 bytes (-21.11%)
Burrows-Wheeler transform (Wikipedia) bzip2 bzip2 -9 88804 bytes -17294 bytes (-16.30%)
Brotli (Wikipedia) brotli brotli -q 11 92406 bytes -13692 bytes (-12.91%)
LZMA2 (Wikipedia) xz xz -9 94568 bytes -11530 bytes (-10.87%)
Zstandard (Wikipedia) zstd zstd -19 97259 bytes -8839 bytes (-8.33%)

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