dwitter.net | #circuit

+ New dweet
function u(t) {
} //
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.
Current theme challenge: #ScaryMovies
show FPS hide FPS share 1 remix fullscreen

function u(t) {

}//
126/140


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

  • Prime fun 2 / 3 - Normally X binary XOR with Y produces a single white line, but if we only draw black when X XOR Y is a prime number, then we get a pattern. #math #primes

Please log in (or register) to comment.

show FPS hide FPS share fullscreen

function u(t) {

}//
131/140


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

  • Circuit Diagram
  • u/tomxor
    Nice! most convincing xor sampling #circuit pattern i've seen, lots of ball grid arrays
  • u/ntsutae
    (i-t)^(i+t) is great.
  • u/rodrigo.siqueira
    Change ^ to | and you will see falling Sierpinsky triangles! I mean: (i-t)|(i+t)
  • u/ntsutae
    Yes, I've already tried "|","&". The triangles appeared without the use of recursive call. Dwitter told me bit operation skills. Thank you.

Please log in (or register) to comment.


function u(t) {

}//
112/140


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

  • Digital City, feat. a distinct lack of primes. #texture

Please log in (or register) to comment.

You've reached the end.