Top dweets of all time

function u(t) {

c.width=1920 // clear the canvas
for(i=0;i<9;i++)
x.fillRect(400+i*100+S(t)*300,400,50,200) // draw 50x200 rects

} // 122/140

Please log in (or register) to post a dweet (copy-paste the code somewhere safe to save it meanwhile)


    u(t) is called 60 times per second.
    t: Elapsed time in seconds.
    S: Shorthand for Math.sin.
    C: Shorthand for Math.cos.
    T: Shorthand for Math.tan.
    R: Function that generates rgba-strings, usage ex.: R(255, 255, 255, 0.5)
    c: A 1920x1080 canvas.
    x: A 2D context for that canvas.

Try the new frontend: beta.dwitter.net
Current theme challenge: #Food

show FPS hide FPS share 1 remix fullscreen

Xen

remix of d/4188 by u/xem

function u(t) {

t?k=c.width=95:d=0;for(e=[i=5e3];i--;x.fillRect(i%k,i/k,1,e[i]=(n-1|d[i])==3|i%9&!d))for(j of[n=1,94,k,96])n+=d[i+j]+d[i-j];d=e

Dec 27 2017 11:04 PM UTC

}// 127/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

follow the remix for info ^^

u/JoshiRaez

Omg, tje game of life. Cool :D
u/xem

Nice, my version just tried to be as precise as possible with more characters
u/eviltoad

Beatiful!
u/katkip

#gameoflife

show FPS hide FPS share fullscreen

lionleaf

remix of d/3719 by u/soer9606

function u(t) {

c.width=1920;
for(i=0; i<1000; i++)
x.fillRect(940+900*S((t+i)), 700+400*S(2.5*t*t+i)/(1+.2*t*t)-400/(.2*t*t+1), 20, 20)//Add gravity :D

Dec 26 2017 11:01 PM UTC

}// 136/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Had to add some gravity so I finally can go to bed!

show FPS hide FPS share fullscreen

nonce

remix of d/894 by u/iverjo

function u(t) {

for(i=c.width=99;i--;){for(j=55;j--;){for(k=32,a=b=0;--k&&a*a+b*b<4;a=_)_=a*a-b*b+(i-27)/t**3-7/4,b=2*a*b+(j-27)/t**3;x.fillRect(i,j,1,!k)}}

Apr 2 2017 3:40 AM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

This is a zoom into the mini-mandelbrot at -1.75 + 0i

Show more comments…
u/donbright

super cool, amazing.
u/Renaud___

Nice
u/jick

Holy cow, this is great.
u/ObjectDisoriented

Did you just do a low res mandlebrot in 140 characters? Way more awesomes needed.
u/sigveseb

Nice! Here's mine from a while back: https://www.dwitter.net/d/1735
u/iverjo

#mandelbrot #fractal
u/katkip

no way

show FPS hide FPS share fullscreen

tomkh

function u(t) {

for(c.width=i=1920;i--;){for(h=63&i,v=i>>6,e=k=g=30;k--;)r=S(k-t)+1-h/g,d=C(3*k+t)+1-v/g,d=d*d+r*r,e=e>d?(s=k,d):e;x.fillRect(h*g,v*g,s,s)}

Mar 5 2017 7:47 PM UTC

}// 139/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

u/sfz

What alchemy is this?
u/tomkh

just a brute-force Voronoi Diagram
u/donbright

WOWWWWW
u/magna

How in the ...
u/Xen

131bytes: for(c.width=i=1920;i--;x.fillRect(h*g,v*g,s,s))for(h=63&i,v=i>>6,k=e=g=30;k--;e=e>d?(s=k,d):e)d=C(3*k+t)+v/g,d=d*d+r*(r=S(k-t)+h/g)
u/Xen

131bytes: for(c.width=i=1920;i--;x.fillRect(h*g,v*g,s,s))for(h=63&i,v=i>>6,k=e=g=30;k--;e=e>d?(s=k,d):e)d=C(3*k+t)+v/g,d=d*d+r*(r=S(k-t)+h/g)

show FPS hide FPS share 1 remix fullscreen

FireFly

function u(t) {

t || x.translate(960, 540)
for (i=40; i--; x.rotate(S(t)))
 x.fillStyle = 'hsla('+i*t+',90%,50%,'+1/t+')',
 x.fillRect(v=i*20, v, i*t, i*t)

Mar 1 2017 8:05 PM UTC

}// 139/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Colour mania

u/iverjo

Nice!
u/Woodmouth

Ohh, if you wait long enough it goes grey, but then if you wait even longer, it quite suddenly goes back to color, and then suddenly even more grey
u/joeytwiddle

After that it ends up resting on a kind of shiny brushed metal pattern. Amazing!
u/joeytwiddle

#shiny
u/joeytwiddle

#color #rainbow (sorry for spamming the comments)

show FPS hide FPS share fullscreen

icecuber

function u(t) {

c.width=432;F=(n,r=0,m=1)=>n?F(n/9|0,n/3%3^1?r+n%3*m:m*3-1-r-n%3*m,m*3):r%27*9;for(j=6;j--;)k=j?t*8-j-7:t<<3,x.fillRect(F(k|0),F(k/3|0),7,7)

Nov 4 2016 2:16 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

u/iverjo

Snake!
u/donbright

lol really wishing for sound effects now
u/lionleaf

#snake #game
u/katkip

#ai
u/joeytwiddle

#tribute

show FPS hide FPS share fullscreen

danny@hille.dk

remix of d/33574 by u/danny@hille.dk

function u(t) {

for(w=i=1080;i--;)(S(i)*w|0)+8*t&1&&(x[r='fillRect'](m=i*30+t*120-w,t*120,4,4),x[r](m,w-t*120,4,4))

Apr 9 2025 3:01 PM UTC

}// 99/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Hitomezashi Stitch Remix

u/cantelope

wow
u/danny@hille.dk

94b -> for(w=i=1080;i--;T=t*120)(S(i)*w|0)+8*t&1&&(x[r='fillRect'](m=i*30+T-w,T,4,4),x[r](m,w-T,4,4))

show FPS hide FPS share 3 remixes fullscreen

tomxor

function u(t) {

eval(unescape(escape`𩡯𬠨𨰮𭱩𩁴𪀦👙👚👩🐷𩐴𞱩𞱓𚰽𦀬𠰫👙𛁔𚰽𦠩𚀱𚱓𛰲𜑞𠰯𜐸𧡔𛰱𝠩𙐱𝑼𯀨𦀽𦐬𦐽𦠬𬠽𭑛𪰽𦱾𤰬啓𛁾𥁝𧑼👚👓𚡴𙐲𛐱𛀭𛑩🠴𩐴🱩𙐶🱵𦱫𧐫𚰺𤰽𠰽𥀽𜐸𝀺𮀮𩡩𫁬𤡥𨱴𚁘👩𙠲𝐵𛁙👩🠾𞀬𞀯𚀸𚱲𛱴𚐬𦠽𜐬𤰽𠰽𥀽𜐲𞀬𦀽𦀯𤰭𜐬𦐯👓𚐩`.replace(/u../g,'')))

Dec 9 2024 12:16 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Photon-Mapping using a Random-March Scattering Model

Show more comments…
u/tomxor

A (very inefficient) physically based renderer in a Dweet! :) Give it 5 mins for reasonable convergence, the longer the better, Firefox is fastest. I know this is not the most interesting visually, but I found it challenging to make, and didn't fully understand the result. So the following hand wavey write-up is more of an analysis as I attempt to understand what's going on. I am not a PBR expert so I probably don't know what I'm talking about.
u/tomxor

This approach conceptually follows Photon Mapping, where light rays are forward traced, bouncing around the scene recursively, accumulating radiance into a spatial map on each bounce. Essentially painting reachable surfaces with light. Separately a ray for each pixel is cast into the scene to retrieve the current radiance for the position it intersects. From here, implementation deviates substantially from the original algorithm. Rays are marched. The map only stores irradiance, and uses spatial hashing instead of a kd-tree. However the most interesting differences are in surface interactions. BSDFs are the standard abstractions for reflectance and transmission but they are far too large to implement. Through "experimentation", AKA messing around on Dwitter, I found a roughly Lambertian reflectance distribution to emerge from a simple random march. Lambertian meaning a perfectly diffuse surface, which causes uniform propagation through 3D space, but a necessarily non-uniform distribution of reflected angles (this is worth taking some time to understand separately if it's not immediately intuitive).
u/tomxor

With ray marching each intersection naturally ends up embedded in a surface. Instead of correcting this, a new direction is randomly chosen and the ray is sent on it's way. Depending on the surface intersection depth and angle of reflection there is a chance the ray will escape (reflect) or remain trapped (absorbed). With the chance being greatest when reflecting in line with the surface normal, and lowest when parallel to the surface. Note how the surface, depth, and reflection ray form a right-triangle. For the reflection ray to escape, the depth must be less than cos(θ) at a step size of 1. Therefore assuming a uniformly random depth between 0 and 1, the reflectance distribution follows Lambert's cosine law. Additionally unlike a BSDF this provides random absorption for free, but with the disadvantage of reflectance distribution and absorption rate being inextricably linked. Another significant difference is that BSDFs are a statistical abstraction designed to extract the most value from each ray by modulating its radiance, representing many photons; whereas this model effectively represents a single photon for each surface intersection. Absorbed rays are thrown away rather than modulated, and each irradiance accumulation is an integer increment. The implication being the random march requires far more rays to converge because each ray has a binary existence and intensity like a photon, on the other hand each intersection is far simpler computationally compared to BSDFs.
u/tomxor

There are a few more gnarly details that complicate this. For simplicity I suggested trapped rays are immediately absorbed, which is possible, but it's simpler to allow them to rattle around a bit. This "widens" the reflectance distribution and increases overall reflectance, to a degree depending on how many consecutive intersections are allowed. But it also changes the overall behaviour by producing a slight Subsurface Scattering effect like skin or paper. Surfaces soften and glow as rays traverse, and weak points like corners diffuse as some rays tunnel through. Secondly, rays with a higher angle of incidence (ωi) have a lower max surface depth, yet the reflectance step length is unaffected. This difference distorts the reflectance distribution as ωi increases. When (ωr < ωi) escape is certain, and when (ωr > ωi) the chance abruptly returns to cos(ωr)/cos(ωi). i.e min(1, cos(ωr)/cos(ωi)). At ωi=0 the distribution is perfectly Lambertian, and at ωi=π/2 it is unnaturally uniform in angle. AFAIK this is not a physically realistic reaction to ωi. It almost resembles Fresnel reflections, where transmissive surfaces reflect more at grazing angles. However Fresnel is anisotropic, like a mirror. Yet here the distribution is centered around the surface normal. This is still a simplified analysis, it ignores subsurface marching, and how adjacent ωr and ωi share pseudo random variables (see below). The chaotic nature and compounding biases means an accurate distribution can probably only be obtained empirically.
u/tomxor

Finally, the ray step/direction vector, must be randomised upon each intersection. Initialising random unit vectors takes a lot of code, so there's a few tricks going on here, but these tricks also affect the result and noticeably compromise accuracy. Rather than a unit vector I've settled for a point in a cube, where the length is anywhere between 0 and 1. This actually helps convergence by randomising depth at repeat surface intersections, however the cube shape results in non-uniform propagation so distance based shading of all the axis aligned surfaces looks a bit too flat. Doing this three times still takes a lot of code, so only Z is randomized upon each intersection, and is then reused by cycling through the XY components, which provides a pretty bad but not-terrible distribution, apparently making it harder to reflect into corners. Z's randomisation combines t with one component of the ray position, so it is effectively a kind of feedback PRNG derived from the very scene geometry the randomness is being used to traverse, which I find kind of neat.
u/Joachim

Insane! Looks sooo realistic :0
u/fentbiggesthater

wow just came back from my vacation in saudi arabia. im now back in my 10m penthouse in new york and this is the first post ive seen after coming back that has genuinely impressed me. good job!
u/UEZ

Very impressive - well done! How can I understand: k = [~S, ~C, ~v], u[k] |= Z. Array u refers to what? Associative arra? Thx.
u/tomxor

Thanks. u is the dweet function which I'm exploiting as a predefined object for the spatial map. The purpose of bitwise inverting ~ each component is to obtain a floored version of the ray position (that it happens to invert doesn't matter) e.g [~0.1,~1.2,~2.3] = [-1,-2,-3], and importantly all positions between [0,1,2] and [1,2,3] will result in [-1,-2,-3] i.e it is binning positions into an integer grid. When passed as a key to u this is coerced into a string to become '-1,-2,-3'. The idea is to count photon intersections into each grid cell with u[k]++ as a kind of frequency based irradiance, but as an object each cell must be initialised before incrementing, so u[k]|=Z uses bitwise again to coerce all values into an int, ORing with Z will convert undefined values to 0, and existing integer values will be unaffected because Z is always less than 1.
u/UEZ

Thanks tomxor. The math / physics behind is too high for me ^^. My question is more related to understand JS what u[k] is. k is an array which is passed to u. When k=[10, 20, 30], what is the result in u[k]++?
u/magna

u/UEZ The property accessor [key] coerces key to a string. So, when you do obj[a] and a is [1,2] it will be obj['1,2'] because [1,2].toString() implicitly called.
u/magna

u/tomxor Another epic one!
u/UEZ

Thx magna :-) More or less what tomxor wrote. Just for my understand, does u[k]++ mean, when k=[1,2,3], u is u['2,3,4']?
u/fentbiggesthater

hm coll
u/tomxor

I think you're getting hung up on the array like key notation, but it's not being used as an array. Think of -1,-2,-3 as an abitrary property name on an object, the u.-1,-2,-3 property syntax would be equivalent if not for the invalid chars. u[k]++ simply increments a number stored for the property k, ++ only works because that property value has been previously initialised using u[k]|=0 which will convert undefined values to 0.
u/jellyedwards

Holy crap! They need to add a dwitter category to the Nobel awards for stuff like this!
u/0x61

[insert image of dribbling cat] We're not worthy. This is endgame
u/KilledByAPixel

https://www.reddit.com/r/tinycode/comments/1…
u/joeytwiddle

#stochastic #lighting #d3

show FPS hide FPS share 1 remix fullscreen

KilledByAPixel

remix of d/29339 by u/KilledByAPixel

function u(t) {

eval(unescape(escape`󭽩󭍨󚍸󚝦󫽲󚍣󛭷󪝤󭍨󯌽󪼽󜼵󞽫󛜭󞽢󩝧󪝮󤍡󭍨󚍦󪝬󫌨󚜩󚝦󫽲󚍪󟝫󙜳󛍩󟜴󞽩󛜭󞽦󪝬󫍓󭍹󫍥󟝒󚍶󟜹󞜫󞜹󚭃󚍪󙬦󨜩󛍶󛍶󚜩󬜽󪬦󙭩󟌲󛍥󫍬󪝰󬽥󚌴󜼰󚼨󪼾󟬲󚜪󞜹󚽓󚍴󚜪󜼰󜌬󬜿󝬰󜌺󝌰󜌬󜼵󛌹󛌰󛍡󟜨󚍱󟽪󛝩󞭪󚽩󚼱󚜭󚌱󛝓󚍴󚜩󙜱󚼮󝜩󚬱󛬵󝼬󨜩`.replace(/u../g,'')))

Jan 17 2024 11:39 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Default 3D #D3 #default

show FPS hide FPS share 1 remix fullscreen

KilledByAPixel

function u(t) {

eval(unescape(escape`󩭯󬬨󪼽󜝥󝌻󭌼󛬳󙬦󪼭󛜻󪼼󫬦󙭸󛭦󪝬󫌨󮌮󩝬󫍩󬍳󩜨󞜶󜌫󪼪󠼨󪬯󞌩󚬨󛬳󛝴󚜯󝬬󞜲󜌭󭌪󜽥󜼫󪼯󝼱󛌱󞜬󨬿󜜹󞬲󛍫󚭫󛍾󮌮󨭥󩽩󫭐󨝴󪌨󮌮󩭩󫍬󤽴󮝬󩜽󨍨󬽬󚌤󮼡󨬪󞜲󯜠󝜰󙜤󮽫󛼹󞜭󫬥󝜹󯜥󨌩󛌹󚜩󚝪󟝫󙜵󜌬󫬽󝭥󜼫󤼨󪬪󪬪󭌫󪬩󚬳󩜳󛍢󟝔󚍫󚽮󚜾󞜹`.replace(/u../g,'')))

Dec 25 2023 7:36 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Tannenbaum 🎄

u/KilledByAPixel

#xmas #tree
u/UEZ

...O Tannenbaum, o Tannenbaum Wie treu sind deine Blätter! O Tannenbaum, o Tannenbaum! Du kannst mir sehr gefallen! Wie oft hat nicht zur Winterzeit Ein Baum von dir mich hoch erfreut!...
u/tomxor

I was wondering what this had to do with networking or microkernels. Didn't know it was a tree !