Top #fuzzing dweets

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: #Opposites

show FPS hide FPS share fullscreen

tomxor

remix of d/12492 by u/tomxor

function u(t) {

for(c.width=E=X=N=64;X--;)for(Y=N;Y--;x.fillRect(X,Y,K=eval(R)/N%1,K))E+=' '+'XXYYtt-*%&~^'[0|12*Math.random()];eval(E=E.slice(-8-t%16));R=E

Feb 26 2019 12:59 AM UTC

}// 140/140

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

Algebraic Monkeys #fuzzing #waitforit

Show more comments…
u/tomxor

Searching for f(x,y,t) this time. If you have more patience then add operators, parens and increase string length in the slice.
u/Xen

c.width=X=E=N=64 lol
u/tomxor

heh, i missed that opportunity
u/DataMeta

Clever concept, like some old tv grasping at transmissions.
u/DataMeta

Haha, Xen
u/tomxor

Nice analogy :) like a TV into the computable universe, infinite channel! (sorta)
u/21medals

Why the space in between each character of E?
u/tomxor

Because -- and ++ are assignment operators, and I cannot allow those on loops variables X and Y. It's basically cheaper in chars to pad with spaces than test for this with a regex.

show FPS hide FPS share 1 remix fullscreen

tomxor

function u(t) {

x.fillRect(960+eval(R)*135,540+eval(c)*135,8,8)
for(E='',i=8;i--;)
E+='S(tC(tT(t)+-*2 '.match(/.(\(.)?/g)[0|9*Math.random()]
eval(E);R=c;c=E

Feb 23 2019 4:41 PM UTC

}// 140/140

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

Transcendental Monkeys #fuzzing #waitforit

Show more comments…
u/tomxor

Inspired by u/anotherkitten u/21medals This is more likely to draw something by focusing on the [x,y] = f(t) solution space and further reducing that to interesting ones by manipulating allowed input tokens.
u/tomxor

Familiar yet different every time :)
u/tomxor

Trust me, it will draw :P every time the comments bounce it's found a solution and assigned it, but not all combinations draw anything visible.
u/tomxor

Some abstract art!: https://imgur.com/vuVzb40
u/21medals

I don't get why no one awesomes this
u/tomxor

Haha, me too, thanks :) I think it was a little too obscure and broken looking.
u/rep_movsd

#underrated
u/Joachim

This is amazing!! Great job u/tomxor

show FPS hide FPS share 1 remix fullscreen

tomxor

remix of d/18733 by u/joeytwiddle

function u(t) {

D=[5,4,3]
for(i=1e3;i;E=i--%8?E+'X0123456789*/+-&|^~'[(i^i*t)%19]:'')try{D.every((Y,X)=>Y==eval(E))&&(S[E]=1)}catch{}throw Object.keys(S)+E

May 12 2020 11:17 AM UTC

}// 139/140

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

Expression Miner #improved

Show more comments…
u/tomxor

1k tests per frame + variable length + deterministic + keeps solution set
u/tomxor

... +4 chars :P
u/tomxor

Struggling to get it to find anything non linear though e.g D=[0,1,2,4,8]
u/tomxor

#fuzzing
u/joeytwiddle

Great, usable! Off of dwitter, this one generates valid syntax from a grammar: https://github.com/joeytwiddle/dweets-dev/bl…
u/tomxor

Interesting. I once wrote an n-card "24 game" solver which is similar but far more limited in terms of operators - by far the most significant optimization i could find was to combinations based on subexpressions that are equivalent to one already traversed i.e nodes in your AST - maybe that could be applied to yours as well?
u/tomxor

* to prune combinations
u/tomxor

oh and the other fairly decent optimization was pruning combinations based on commutativity of binary operators... i.e another kind of equivalence
u/tomxor

I should clarify: to by pruning I mean not mearly skipping evaluation of individual permutations but to be able to skip entire subtrees of permutations by detecting equivalence at the root of that subtree.
u/joeytwiddle

Pruning does sound sensible, but I'm not sure how to approach it.
u/joeytwiddle

I am also having difficultly with >3 non-trivial outputs. I think the search space is too large. But at least I found some simplifications, such as: [1,3,5,7] => X-~X
u/tomxor

Finally got it to solve a non linear one: D=[2,3,6,11,18,27] (2+X*X), just need a bit more patience

show FPS hide FPS share 1 remix fullscreen

tomxor

remix of d/12402 by u/anotherkitten

function u(t) {

for(a="",i=140;i--;)a+="\"abcdefghijklmnopqrstuvwxyzICAWDMPRST$`%~?:.,()!+-/*=;1234567890[]{}#'< >\\"[Math.random()*73|0];eval(a)

Feb 17 2019 8:38 PM UTC

}// 129/140

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

60 monkeys per second

u/tomxor

#infiniteMonkeyTheorem #fuzzing
u/tomxor

Searching the computational universe for dweets :P

show FPS hide FPS share fullscreen

katkip

function u(t) {

eval(unescape(escape`𭁼𯀨𮠽𙰧𚐬𬰽𘠯𚠴𚰭𙑞𙡾𘠻𩰽𬐽🡻𭰽𙰧𞱷𪁩𫁥𚁷𛡳𬁬𪑴𨀴𨀮𫁥𫡧𭁨🀵𚑷𚰽𬱛𚁍𨑴𪀮𬡡𫡤𫱭𚀩𚠹𚑼𜁝𞱲𩑴𭑲𫠠𭱽𞱦𫱲𚁩🐹𞐻𪐭𛐻𚑻𭁲𮑻𭀽𨀤𮱲👥𭡡𫀨𬐽𩰨𚐩𯐠🐠𙁻𬑽𨀻𬡛𜁝𞱺𚰽𭀫𙱜𫠧𯑣𨑴𨱨𮱽𯑴𪁲𫱷𘁺`.replace(/uD./g,'')))-/44/*~4-4

Jun 2 2020 10:25 AM UTC

}// 140/140

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

four fours puzzle calculator (+ bitwise operators) #throw t||(z=''),s="/*4+-%^&~";g=q=>{w='';while(w.split4.length<5)w+=s[(Math.random()*9)|0];return w};for(i=99;i--;){try{t=${r=eval(q=g())} = ${q};r[0];z+=t+'\n'}catch{}}throw z

u/tomxor

Wow nice! it's so fast.
u/tomxor

Hah, A lot of variations with comments appended, I found when doing this kinda #fuzzing it can be useful to padd the operators with spaces, you like a few things like power and decrement/increment but also protect loop variables from assignment and stop comments.

show FPS hide FPS share 1 remix fullscreen

joeytwiddle

function u(t) {

D=[5,4,3]
for(E='',L=3;L--;)E+='i0123456789*/+-&|^~'[Math.random()*19|0]
try{if(D.every((o,i)=>eval(E)==o))T=E}catch(r){}
throw T+','+E

May 12 2020 1:34 AM UTC

}// 135/140

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

Expression miner: Finds an E length L that generates D #waitforit

Show more comments…
u/joeytwiddle

E.g. for D=[7,2,5] and L=5 it produced 5/i^7
u/joeytwiddle

(But I did add an extra for loop to make it run faster!)
u/joeytwiddle

Inspired by https://github.com/pavelb/pavelb.github.io/b… whatever that is
u/tomxor

Nice #fuzzing
u/pavel

😂 the code is a mess but its useful. The ascii vomit encodes the valid next char to speed things up.
u/joeytwiddle

Ah I see, that's what it's for!

You've reached the end.

dwitter.net | #fuzzing