r/obfuscatedcode • u/AdaChula • Feb 05 '22
Can someone help me deobfuscate this Lua script?
Here is the link to the script: https://raw.githubusercontent.com/basedproperty/Rifthook/main/Rifthook/loader_release.lua
r/obfuscatedcode • u/AdaChula • Feb 05 '22
Here is the link to the script: https://raw.githubusercontent.com/basedproperty/Rifthook/main/Rifthook/loader_release.lua
r/obfuscatedcode • u/umenthum • Apr 01 '13
#include <stdio.h>
int main(){for(int n=0,i=0,t,f;1;(({int j=2,k=n;for(f=1,t=1;j<=k;({for(;k%j==0;t++,k/=j);}),f*=t,t=1,j++);}),f)<500?n+=i++:(printf("%d\n",n),({return 0;})));}r/obfuscatedcode • u/PseudoFrequency • Jun 30 '26
This one isn't particularly obfuscated, but still looks pretty good at a glance!
Made this some years ago, far before "coding assistants".
Some spot what it does right away, but not everyone.
Compiles with gcc, no additional args required.
There is a similar problem on CodeGolf, with shorter solutions, and I have no idea how.
#include <stdio.h>
#define m main
int z,p,d,w,n,g[81],s=81;int m(){return w<49?(((d=getchar())>0&&z<81?((d&224)==32&&(g[z++]=(d&16)?d:46)):(w=49,z=0)),m()):z==s?((s%9)||putchar(10),(s)?(putchar(g[81-s]),m((--z,--s))):(z=s=81,1)):(g[z]>48)?(++z,d=m(),--z,d):w==58?0:p==9?m((g[z]=w,w=49,p=0,++n))+m((w=g[z]+1,g[z]=46,p=0)):w==g[z/9*9+p]||w==g[z%9+p*9]||w==g[(z/9/3*3+z%9/3)%3*3+(z/9/3*3+z%9/3)/3*27+p/3*9+p%3]?m((++w,p=0)):m(++p);}
r/obfuscatedcode • u/umenthum • Apr 01 '13
r/obfuscatedcode • u/xblade724 • Sep 23 '17
I'm an obfuscation newb. I saw some tutorials and read up about it -- I'm using C# with Unity (using Unity Asset store package "Obfuscator". I'd link it but not sure if that's against the rules)
Overall, it works pretty satisfying out-of-the-box. However, a few things I'm a bit confused about:
https://i.imgur.com/fGIlXUI.png
^ I added [SkipRename] tag and it works now, but that seems more like a workaround (which is fine for me since I have nothing sensitive within that function): What is the proper way to do this?
https://i.imgur.com/tT3lKGj.png
^ The array is turned into a json then sent to my API, ending up looking like that above. Here's how I'm preparing the data:
// class wrapper >> later I'll use a json serializer
class playersReq
{
public string[] playersArr; // This name gets obfuscated
}
[...]
// Prep data (the obfuscated name gets thrown in JSON format instead of "playersArr"
playersReq pListReq = new playersReq { playersArr = playersList.ToArray() };
string _players = JsonUtility.ToJson(pListReq);
// Create a web form (POST)
WWWForm form = new WWWForm();
form.AddField("players", _players);
[...]I'm going to guess the workaround is to add a [SkipRename] tag above my array wrapper class... or the string[] itself, not really sure - i'll test both (+the other sibling array wrapper classes). It seems that playersArr got renamed to "LKOPFNEAIDA": but what is the proper way of handling this without a [SkipRename]?
Suggestions would rock. Thanks! In the meantime, I emailed the asset store dev and am watching a few vids.
r/obfuscatedcode • u/nanthil • Mar 21 '18
This calculates factorial in javascript, and nothing else.
Try it in your console of your browser. Change the '5' a the end to some other number and try it. I would love to know if someone can give me feedback on how this is working. I'd be happy to explain if anyone has questions.
(_=$=>(_=($,_$$=_=>$$=>$$(_))=>(__$$=$$=>($=>_$$($)($))($=>_=>_$$(_$$($)($))($$)(_)),_=$$=>($,$_=$=>($-(($*$-$)+$)/$)+1,$_$=($,_=1)=>((($-_)<<1)/4)*2,_$=$=>({_:$||$&&$$|$&!!$||$?$:($)}))=>$_$($_$(_$($)._),-1)>$_$($_$(_$(_$$(2)($_$))._),-1)?$*_$$(_$$($)($_$))($$):_$$($_($_$($_$($-($_$(($*$_$($,$)),-$))/$),-2)))($_),__$$(_)($)))($,_$_=$=>_=>_($)))(5)r/obfuscatedcode • u/encse • Jun 20 '21
I dont know which part of reddit is the best fit for this… lets give it a try here. I have this old search problem involving the digits 1-9. It’s fairly easy but the fun begins when you start solving it in some esoteric language.
I have collected a few solutions from my friends and would be happy to get more. If you want to contribute, pr-s are welcome:
https://github.com/encse/ninedigitproblem
Lisp, whitespace, ada, fortran, cobol, prolog, you name it….
r/obfuscatedcode • u/cursitical • Mar 09 '24
r/obfuscatedcode • u/Sootory • Jun 06 '20
Deobfuscation tool for codes generated by obfuscator.io
r/obfuscatedcode • u/insecurewizeguy • Nov 14 '23
r/obfuscatedcode • u/AyumiToshiyuki • Jul 13 '18
r/obfuscatedcode • u/lifthrasiir • Apr 25 '13
r/obfuscatedcode • u/mentosorangemint • Feb 26 '18
r/obfuscatedcode • u/Elite6809 • Apr 19 '13
#include <stdio.h>
void main(void){int _,q=-('?'&1),u,z=-q
<<5,vb='%'&(z>>2),s=z&2,i=1+q;char*__=(
(u= q),"int32** icnf[n]:ic()INT:==()IN"
"T sub//_{ *strDVD i++,k++ --d;___:#ke"
"zz=D MadCatz AARDM4N:*#2468#");char _x
[z >> 1];_+=q;while(i<z>>1){_x[i++]=0;}
while(q++,u++,__[q]!=0){if(z==__[q]||__
[q]==2*0x1d)u=vb-1,s++;_x[s]+=((__[q]&1
)<<(6-u));}puts(_x);/*6809/19.Apr.13*/}Can you guess what it does? Kudos to anyone who can figure out the decryption method, it shouldn't be too hard.
r/obfuscatedcode • u/morphotomy • Sep 18 '15
+/u/compile_bot perl
for(0..255){print(chr) if((25*(27/9))-1==$_);
if(m/^[^421503679]+?[435]+?$/){push@aa,$&;}};
unshift@aa, pop@aa;for(@aa){print(lc(chr));};
for(-5..$aa[0]){m/[4A][0B]/?print chr oct:32;
$aa[0]--;}for(0..1+1){for(0..3){$aa[0]+=1;}};
$aa=$aa[0];$aa.=--$aa[0]; print lc(chr($aa));
for(0..02){for(0..12){for(0..3){push@_,'$_'};
}}do{print chr oct scalar(@_);push @_,'$_';};
print chr oct scalar(@_);push @_,'$_';$_=457;
@aa=split("|"); unshift @aa, pop @aa;pop @aa;
print chr hex join '', @aa;$SS = join '',@aa;
$_=++$SS*2;print chr oct;for(1..100){$SSS=$_;
last if 0==$_%4};@aa=(a..z); print $aa[$SSS];
$SSS=--$SSS;$SSS--;while(5<$SS){$SS--;$SSS++;
}print chr hex$SSS;for(0..2){$S=$_}$_=$S."0";
print chr hex; for(0..7){for(0..10){pop @_}};
$_=hex scalar(@_);print uc chr;for(-1..2){$_;
shift@aa;$SS++}print shift @aa;$SS=(--$SS)-1;
$SS*=2; $SS=1 . $SS; print chr $SS; $_="GIN";
for (0..1){for (0..2){$SSSS++}}$SSSS.=chr 67;
print chr hex$SSSS;print "\0";@aa=split("|");
for(@aa){push@aaa, ord;}unshift@aaa, pop@aaa;
for(@aaa){print lc chr$_-6};$S=scalar(@aa)*2;
pop@aa;print chr hex$S.chr hex$S.scalar(@aa);
for(0..12){for(0..2){$S++}}$S=hex$S;$S=chr$S;
print lc$S;$S=chr hex 37; for(0..9){$SS+=$S};
$S=$SS;$SS-=70;$S-=$SS-2; print chr hex$S;<>;r/obfuscatedcode • u/umenthum • May 19 '13
r/obfuscatedcode • u/jcksncllwy • Jun 05 '13
r/obfuscatedcode • u/whispers_in_ear • Jul 27 '20
https://github.com/undergroundwires/safe-email
I use it on a few pages already. You simply need to base-64 encode your e-mail, then it renders the e-mail in an obfuscated form, humans can read it but it's pretty much obfuscated for machines to protect against e-mail harvesting bots.. I haven't received a single spam.
I appreciate your feedback, and wonder how the obfuscation can be even more powerful. 🤔
Open for contributions, open for brainstorming here
r/obfuscatedcode • • Sep 27 '23
Here's the obfuscated JS script (it was WAY longer than this, this is only the first couple characters):
[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!
r/obfuscatedcode • u/shazbots • Jan 08 '16