JS1k: The JavaScript code golfing competition

var d,C,B,K,I,t,q,J,k,h,v,o=0,y=99,L=350,e=innerWidth,r=innerHeight,N=document,p=N.body,w,G,m=[],n=Math,E=n.floor,A=n.random,D,g,x,u;p.style.cssText="margin:0;overflow:hidden";w=p.children[0];w.width=e;w.height=r;G=w.getContext("2d");for(C=0;C<y;){m[C++]=({x:C,y:C,col:"#"+E(A()*9)+"88"})}setInterval(function(){G.fillStyle="rgba(220,220,220,.35)";G.fillRect(0,0,e,r);o+=0.003;for(C=0;C<y;){K=m[C++];k=s(K.x/L+o,v=K.y/L)*5+K.x;h=s(K.x/L-o,v)*5+K.y;k+=(e/2-k)/50;h+=(r/2-h)/50;for(B=C+1;B<y;){I=m[B++];t=I.x-k;q=I.y-h;if(n.sqrt(t*t+q*q)<20){J=n.atan2(q,t);I.x+=((k+n.cos(J)*20)-I.x)/4;I.y+=((h+n.sin(J)*20)-I.y)/4}}G.fillStyle=K.col;G.fillRect(K.x=k,K.y=h,2,2)}},20);d=[[1,1],[-1,1],[1,-1],[-1,-1],[1,0],[-1,0],[1,0],[-1,0],[0,1],[0,-1],[0,1],[0,-1]];function s(b,a){I=(b+a)*0.366;t=E(b+I);q=E(a+I);B=(t+q)*0.21;D=b-(t-B);g=a-(q-B);x=D>g;return 70*(F(D,g,(u=(t&255)+(q&255))%12)+F(D-x+0.21,g-!x+0.21,(u+1)%12)+F(D-0.58,g-0.58,(u+2)%12))}function F(a,c,b){B=0.5-a*a-c*c;if(B<0){return 0}return B*B*B*(d[b][0]*a+d[b][1]*c)}

dmFyIGQsQyxCLEssSSx0LHEsSixrLGgsdixvPTAseT05OSxMPTM1MCxlPWlubmVyV2lkdGgscj1pbm5lckhlaWdodCxOPWRvY3VtZW50LHA9Ti5ib2R5LHcsRyxtPVtdLG49TWF0aCxFPW4uZmxvb3IsQT1uLnJhbmRvbSxELGcseCx1O3Auc3R5bGUuY3NzVGV4dD0ibWFyZ2luOjA7b3ZlcmZsb3c6aGlkZGVuIjt3PXAuY2hpbGRyZW5bMF07dy53aWR0aD1lO3cuaGVpZ2h0PXI7Rz13LmdldENvbnRleHQoIjJkIik7Zm9yKEM9MDtDPHk7KXttW0MrK109KHt4OkMseTpDLGNvbDoiIyIrRShBKCkqOSkrIjg4In0pfXNldEludGVydmFsKGZ1bmN0aW9uKCl7Ry5maWxsU3R5bGU9InJnYmEoMjIwLDIyMCwyMjAsLjM1KSI7Ry5maWxsUmVjdCgwLDAsZSxyKTtvKz0wLjAwMztmb3IoQz0wO0M8eTspe0s9bVtDKytdO2s9cyhLLngvTCtvLHY9Sy55L0wpKjUrSy54O2g9cyhLLngvTC1vLHYpKjUrSy55O2srPShlLzItaykvNTA7aCs9KHIvMi1oKS81MDtmb3IoQj1DKzE7Qjx5Oyl7ST1tW0IrK107dD1JLngtaztxPUkueS1oO2lmKG4uc3FydCh0KnQrcSpxKTwyMCl7Sj1uLmF0YW4yKHEsdCk7SS54Kz0oKGsrbi5jb3MoSikqMjApLUkueCkvNDtJLnkrPSgoaCtuLnNpbihKKSoyMCktSS55KS80fX1HLmZpbGxTdHlsZT1LLmNvbDtHLmZpbGxSZWN0KEsueD1rLEsueT1oLDIsMil9fSwyMCk7ZD1bWzEsMV0sWy0xLDFdLFsxLC0xXSxbLTEsLTFdLFsxLDBdLFstMSwwXSxbMSwwXSxbLTEsMF0sWzAsMV0sWzAsLTFdLFswLDFdLFswLC0xXV07ZnVuY3Rpb24gcyhiLGEpe0k9KGIrYSkqMC4zNjY7dD1FKGIrSSk7cT1FKGErSSk7Qj0odCtxKSowLjIxO0Q9Yi0odC1CKTtnPWEtKHEtQik7eD1EPmc7cmV0dXJuIDcwKihGKEQsZywodT0odCYyNTUpKyhxJjI1NSkpJTEyKStGKEQteCswLjIxLGctIXgrMC4yMSwodSsxKSUxMikrRihELTAuNTgsZy0wLjU4LCh1KzIpJTEyKSl9ZnVuY3Rpb24gRihhLGMsYil7Qj0wLjUtYSphLWMqYztpZihCPDApe3JldHVybiAwfXJldHVybiBCKkIqQiooZFtiXVswXSphK2RbYl1bMV0qYyl9

(function () {
	var grad3,
	i,j,a,b,dx,dy,ang,ix,iy,sy,
	z=0, l=99,scale=350,
	W=innerWidth, H=innerHeight,
	doc = document, body = doc.body,
	ca,c,
	dots=[],
	M=Math,
		f=M.floor, ra=M.random,
	
	x0, y0, i1, iijj;
	
	body.style.cssText="margin:0;overflow:hidden";
	
	ca=body.children[0];
 	ca.width  = W;
 	ca.height = H;
	c = ca.getContext("2d");
	
	for (i=0;i<l;)
		dots[i++]=({	x:i, y:i, col:"#"+f(ra()*9)+"88"});
		
	setInterval(function () {
		c.fillStyle = "rgba(220,220,220,.35)";
		c.fillRect(0,0,W,H);
		z+=.003;
		for(i=0;i<l;) {
			a=dots[i++];
			ix=noise(a.x / scale + z, sy=a.y / scale) * 5 + a.x;
			iy=noise(a.x / scale - z, sy) * 5 + a.y;
			ix+=(W/2-ix)/50;
			iy+=(H/2-iy)/50;
			
			for(j=i+1;j<l;) {
				b=dots[j++];
				dx=b.x-ix;
				dy=b.y-iy;
				if(M.sqrt(dx*dx+dy*dy)<20) {
					ang=M.atan2(dy, dx);
					b.x+=((ix + M.cos(ang)*20)-b.x)/4;
					b.y+=((iy + M.sin(ang)*20)-b.y)/4;
				}
			}
			c.fillStyle = a.col;
			c.fillRect(a.x=ix, a.y=iy, 2, 2);
		}
	}, 20);
	
	/*********** PERLIN *************
	
	Based on Sean McCullough's implementation of Stefan Gustavson's java 2D SimplexNoise
	http://gist.github.com/304522
	
	********************************/
	grad3 = [[1,1],[-1,1],[1,-1],[-1,-1], 
             [1,0],[-1,0],[1,0],[-1,0], 
             [0,1],[0,-1],[0,1],[0,-1]];
	function noise(xin, yin) {

		b = (xin+yin)*.366;
		dx = f(xin+b);
		dy = f(yin+b);
		j = (dx+dy)*.21;
		x0 = xin-(dx-j);
		y0 = yin-(dy-j);
		
		i1=x0>y0;
		return 70 * (gg(x0,y0, (iijj = (dx & 255) + (dy & 255)) % 12) + gg(x0 - i1 + .21,y0 - !i1 + .21,(iijj+1) % 12) + gg(x0 - .58,y0 - .58,(iijj+2) % 12)); 
	};
	function gg(x,y,g) {
		j = 0.5 - x*x-y*y;
		if(j<0) return 0;
		return j * j * j * (grad3[g][0]*x + grad3[g][1]*y);
	}
})();