How do I de obfuscate a script?

Help and Feedback Scripting Support
#1

I have been searching for hours on how to do this and thought I was getting somewhere and I wasn’t… I found something that made it a little easier to understand but I’m new to scripting so I have no idea what I’m doing… Well I spent money on this advanced locker asset to not even be able to use it for my teams every time I change the team name they gave you in the packet it completely breaks the system…and I’m getting a feeling the way to change that is in one of these scripts and I wont be able to get a ticket open in there communication server to get it either and my reasons I feel that way is the locker system looked exactly what I wanted and when I got it was completely different from the picture. I know for a fact that’s where I can change the team names but I don’t know how to break it down and turn it into regular Roblox format… Here is the code to look at…

local d=string.byte;local h=string.char;local c=string.sub;local s=table.concat;local e=table.insert;local I=math.ldexp;local Q=getfenv or function()return _ENV end;local r=setmetatable;local R=select;local a=unpack or table.unpack;local i=tonumber;local function O(d)local l,n,o="","",{}local t=256;local a={}for e=0,t-1 do a[e]=h(e)end;local e=1;local function f()local l=i(c(d,e,e),36)e=e+1;local n=i(c(d,e,e+l-1),36)e=e+l;return n end;l=h(f())o[1]=l;while e<#d do local e=f()if a[e]then n=a[e]else n=l..c(l,1,1)end;a[t]=l..c(n,1,1)o[#o+1],l,t=n,n,t+1 end;return table.concat(o)end;local i=O('26D25O27525Q25K27525O24R24T24H24P25Q25I27923V24P25424F24P25A25624L24V27E25N27924C24G24T25127M25B25Q27S27525A24P25925524L28325Q25M27925B24V25A24L25825425Q25H27923U25524I24V25424L24J24I27Z25G27927L25428P24I24R27Z26527924E24P25824G27P24T25424P24O24F25424J25A24T24R27E25C27924B24T24L25423U29F23Z24K24L24G24O28927923X28X28727E28J27524B29F24N25B25824T27Q25Q25D27923K24J24V24N27M24324F25125B29A24H25Q28U27523Y24J24O25124825125827E25Q29326Y29X27523K24T24U24P24G27Z25J29Y2A02832B62B824G2AC27924A24L24P25725829F29P29G27D25Q2BC27527U2AA24P24K24J29V27M28027923S24P2AN25A24J2512B425O24C24T28324I28H25L2792A928727Z25E27H27J2C628C24P24I24O24T2CH27Z25R27923P25B23X2AQ27923Y24T25B24P2CE25A28H27827523M27C27E27G27523Z2DG29G2DA28H2BV25O23P2CH27M2AA28P28R25Q25F27926K2BX27X25A24C24J25B29O28Q24I25Q29K27524829G28S2A92CG24V25125P27927921O26R27F2792DK24I23Z2C129724O24P2CZ2BU27T27V2E223X24O2EW29W28125O2ET24I24I24P28O2DX27T2C925024L24H29O25124C2C924H28G28I2792ED24L24R29I28329W2DI25O2CA23V25026W27024Q25524T23V25Q26229Y24O2562CW27Q24O26K2AF2AH27M26K2AL2AN24P24H2EK25O21824V25025D25Q23Y2EA2CP25424B29T29A2972AN2C42BW27V27Q23P24O2CZ27627925Q2CO2DJ24K2CF2DU27M2F32F52H62F828R2FB28O2GQ25O2B12762HG2F82HI29G28O27M2942D828H2A32HY2HJ2I125A2EL25O2F725O26M2IB27526K2IG2HT25O2EK2IK2HD2HT2II2HU2IR2HV2EL2B12IN2IL27925P2F726K25X2IX2752EK26K26N2IX2EK2B125M26L25O2HC2IX2HV26O2IG27526W2JI25O26A2IX2CZ2IW2HT2672HE2642D024I2E724T2972522D92FN2FP25W2GZ2FM24J2AZ2DB25129S2CW29I29C2FT24I2JY2772FR24P27C2HO2F92HR28H2JS27523T28528F2AZ24O23X24V27Q25B25B29F2BM27Z2DD25O2DF2BT2JU27524F24T25629B2KX2KZ2L128E2C72HF2EQ2HZ2HK25A2HM29B2KI2A429N2DC2792572LT2IW2EN2FQ2HH2I829A25A2G928K24L2CU23U2CM25429S29U24O2H127P24K2D12D32CJ2LA29T2DB2D427523N29V24F2MM28H2AD2ML2872542482GO29629927E2MK2CD2CW25428T2792MQ24O2CE2CX2BJ2BW2N625B2MZ2FO27V29A2IT2HT25Q2L92DQ2JW28P2JY24L2K02K62FO2542IB2N425O26I2JI2IQ2EL2IK2IM2JL2IV2IJ2792I62M02I72I02M32M52752M92M82MA2MC29V2MF24V2MH2D225Q2N42MS2MX25Q2KQ25O2KS2862582KV2LF2C72LH2L32LR2L62DG2MO25O2NA2OU2MN2MV25O2PD2MY2N02NK2N327T2NG2PA2NA2NC2N72IB26C2EL2DY2IG2O42IY25O2PX2HD2662HD2JE2IB2B12JA2EL2JS2HT25K2PT2752Q92752632PY2IH2EB2792L52J32DZ2J42IX2O02O52QR2EL2IQ2O72J52QO2J925O2Q22JD2R12IB2EK2EY2PZ2QX2IC25O2NP25O28A2GQ2QG2PW26B2R32R62Q52QZ2HD2AR2IG2Q62RB2EL25Z2J825O2QB2792RR2EK2RU27526J2J32RE2QM26K2QJ2752QL2IN2QU2QP2JL2O62IB2S92O72SE2IR2R02CZ2RM2PY2R52SG27S2RA28J2JQ2IY23T2EL2CJ2S82R72IK2IT2RH2O92S92Q12752CZ2Q42QO2SM2R72782JB2R22JF2752JH2JI2JK2JI26P2JO2QM2TL2RI2O72CJ2IQ2IT28A2792T62PY2B12Q42SW2RS27S2TQ2792TS2T42SB2IR2CZ2T225O28U2SG2I62TD2EK2R02EK2FY2R02B12DP2TV2IX2U829K2SG2AD2SI25O2HX2SL2IR2TS2EK2J72O72RY25O2UY2RT2QC25O2692S12TM26K2Q22TO2RI2TR2QR2QY2U12752UO2HD2B12UQ2S62US2RN2RT2IR2U12B12JU2L92EK2DY2B12J12QM2UO2V22EK2UQ2922CZ29227926E2TK2JA2O72JK2UZ2V42WC2V327926Q2V72S82VA2SA2VG2RP2PY2VF2HD2VH2VC2IR2VL2VP2W62IU2VP2VX2VJ25O2JS2VU2RK2VX2J22HT2UA2W12VP2TB2JP2TD25O2TH2IG2TF2IG2JN2R42TM2QM2NN2PV2CD2K22MY28E2FU27M29B2O52U325O27G2TY2QV2WY2IW2TU2T72XM2IK2NY27526626F2QH2RI2WY2UI2TC2RJ2B12UF2VP2YA2HD2N42VR2WO2QO2RO2YG2L52UR2YO2J22T52R825O2S02RO2YJ2U42IP2U42SJ2RI2YY28J2R02CJ2FY2TT25O2CJ2Z32VP2Z52VP2782BC2IQ2782782ZA27528A2S52W82TA2VQ2J22ZG25O2AD26I2WI2CJ25Y2IX2CO2V031042RX2V42XK2QZ26X2ZF310E2IH25T310E2CJ28A2IQ2CJ2CJ2DY310L310E2JU310P2CJ292310S25O2ZQ2R82R02SU2R82X0310I2X231102O92ZB310F2PZ2J7310M310W2QZ27S27S310Z2792CJ27S2ZH28A2YO2ZR2RP310K311N28A310O311Q2R92RI28A28A2922L92CJ2602RP266310D2CJ2612DZ2J728A2782GA25O2722RP2ID2B12N427S2V02ST2J52J727G28J2QG26629229K2K42W72XZ25O29K2WA312V26T2RS2V0313031092792TJ2J52J2312N25O2J226I25V312V313625O31042V0313F2V023Z2UM3138311C313B2WI27G313L2EK2RR313K313M312V28J313B313D27G312K25O25S2WG2KR2IX2702II28J310H25U25O3148311C313D2II25M26Z310E2732TD2V0314L313731182JC2J631132IF2TB2F72O72XF2YD2JM310E27S314P2N4314R311A310E314U2JC31522RS314Y2QO2792AD311I2IX311731262IH311N312A2EL28A2ID275312H2YL27524U2UM312M311C312P312R2V12EL2W827G312X2RB26G312V24T2QM2V03168314P31393166314S27G27G3158312W2IR2QY315C2TL2XG2UC2JN31632J326S2U92IB314I310E24A314M2V4316Y2UE3124311826623Y2RP26H2792R027S2O22IB28U2HT2R028J2YU27527G2S02IB28J2RO2IQ31392PT2R02BC2ZJ2BC2BC27427929K2O02682ZZ2YQ25O31812CO2ID31812DY2SK316Q25O2DY2SR275');local o=bit and bit.bxor or function(e,l)local n,o=1,0 while e>0 and l>0 do local a,c=e%2,l%2 if a~=c then o=o+n end e,l,n=(e-a)/2,(l-c)/2,n*2 end if e<l then e=l end while e>0 do local l=e%2 if l>0 then o=o+n end e,n=(e-l)/2,n*2 end return o end local function n(l,e,n)if n then local e=(l/2^(e-1))%2^((n-1)-(e-1)+1);return e-e%1;else local e=2^(e-1);return(l%(e+e)>=e)and 1 or 0;end;end;local e=1;local function l()local c,l,n,a=d(i,e,e+3);c=o(c,204)l=o(l,204)n=o(n,204)a=o(a,204)e=e+4;return(a*16777216)+(n*65536)+(l*256)+c;end;local function f()local l=o(d(i,e,e),204);e=e+1;return l;end;local function t()local l,n=d(i,e,e+2);l=o(l,204)n=o(n,204)e=e+2;return(n*256)+l;end;local function C()local o=l();local e=l();local c=1;local o=(n(e,1,20)*(2^32))+o;local l=n(e,21,31);local e=((-1)^n(e,32));if(l==0)then if(o==0)then return e*0;else l=1;c=0;end;elseif(l==2047)then return(o==0)and(e*(1/0))or(e*(0/0));end;return I(e,l-1023)*(c+(o/(2^52)));end;local I=l;local function O(l)local n;if(not l)then l=I();if(l==0)then return'';end;end;n=c(i,e,e+l-1);e=e+l;local l={}for e=1,#n do l[e]=h(o(d(c(n,e,e)),204))end return s(l);end;local e=l;local function h(...)return{...},R('#',...)end local function J()local d={};local c={};local e={};local i={d,c,nil,e};local e=l()local o={}for n=1,e do local l=f();local e;if(l==3)then e=(f()~=0);elseif(l==1)then e=C();elseif(l==2)then e=O();end;o[n]=e;end;for e=1,l()do c[e-1]=J();end;i[3]=f();for i=1,l()do local e=f();if(n(e,1,1)==0)then local c=n(e,2,3);local a=n(e,4,6);local e={t(),t(),nil,nil};if(c==0)then e[3]=t();e[4]=t();elseif(c==1)then e[3]=l();elseif(c==2)then e[3]=l()-(2^16)elseif(c==3)then e[3]=l()-(2^16)e[4]=t();end;if(n(a,1,1)==1)then e[2]=o[e[2]]end if(n(a,2,2)==1)then e[3]=o[e[3]]end if(n(a,3,3)==1)then e[4]=o[e[4]]end d[i]=e;end end;return i;end;local function s(e,t,d)local n=e[1];local l=e[2];local e=e[3];return function(...)local o=n;local O=l;local c=e;local I=h local l=1;local f=-1;local Q={};local J={...};local h=R('#',...)-1;local i={};local n={};for e=0,h do if(e>=c)then Q[e-c]=J[e+1];else n[e]=J[e+1];end;end;local e=h-c+1 local e;local c;while true do e=o[l];c=e[1];if c<=34 then if c<=16 then if c<=7 then if c<=3 then if c<=1 then if c>0 then if not n[e[2]]then l=l+1;else l=e[3];end;else do return end;end;elseif c>2 then l=e[3];else local o=e[2]local c={n[o](a(n,o+1,f))};local l=0;for e=o,e[4]do l=l+1;n[e]=c[l];end end;elseif c<=5 then if c>4 then local d;local c;n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]];l=l+1;e=o[l];c=e[2]n[c](n[c+1])l=l+1;e=o[l];c=e[2];d=n[e[3]];n[c+1]=d;n[c]=d[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];c=e[2];d=n[e[3]];n[c+1]=d;n[c]=d[e[4]];else local e=e[2]n[e]=n[e](n[e+1])end;elseif c>6 then local c;n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]][e[3]]=n[e[4]];else if(n[e[2]]~=e[4])then l=l+1;else l=e[3];end;end;elseif c<=11 then if c<=9 then if c==8 then local d;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][n[e[4]]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];d=n[e[3]];n[c+1]=d;n[c]=d[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]][e[3]]=n[e[4]];else if not n[e[2]]then l=l+1;else l=e[3];end;end;elseif c==10 then local c;n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]];l=l+1;e=o[l];c=e[2]n[c](a(n,c+1,e[3]))l=l+1;e=o[l];do return end;else if(n[e[2]]==e[4])then l=l+1;else l=e[3];end;end;elseif c<=13 then if c==12 then local d;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][n[e[4]]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];d=n[e[3]];n[c+1]=d;n[c]=d[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]][e[3]]=n[e[4]];else local c;local t;local i,s;local h;local c;c=e[2]n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];c=e[2];h=n[e[3]];n[c+1]=h;n[c]=h[e[4]];l=l+1;e=o[l];c=e[2]i,s=I(n[c](n[c+1]))f=s+c-1 t=0;for e=c,f do t=t+1;n[e]=i[t];end;l=l+1;e=o[l];c=e[2]i={n[c](a(n,c+1,f))};t=0;for e=c,e[4]do t=t+1;n[e]=i[t];end l=l+1;e=o[l];l=e[3];end;elseif c<=14 then n[e[2]]=(e[3]~=0);elseif c>15 then n[e[2]]=n[e[3]][n[e[4]]];else local d;local c;n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];d=n[e[3]];n[c+1]=d;n[c]=d[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];if n[e[2]]then l=l+1;else l=e[3];end;end;elseif c<=25 then if c<=20 then if c<=18 then if c==17 then n[e[2]]=e[3];else local t;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][n[e[4]]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]][e[3]]=n[e[4]];end;elseif c>19 then local e=e[2]local o,l=I(n[e](n[e+1]))f=l+e-1 local l=0;for e=e,f do l=l+1;n[e]=o[l];end;else n[e[2]]=n[e[3]][n[e[4]]];end;elseif c<=22 then if c>21 then local l=e[2]n[l](a(n,l+1,e[3]))else local t;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][n[e[4]]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]][e[3]]=n[e[4]];end;elseif c<=23 then n[e[2]]=t[e[3]];elseif c==24 then n[e[2]]=(e[3]~=0);else n[e[2]]=n[e[3]][e[4]];end;elseif c<=29 then if c<=27 then if c==26 then n[e[2]]={};else local a=e[2];local c={};for e=1,#i do local e=i[e];for l=0,#e do local e=e[l];local o=e[1];local l=e[2];if o==n and l>=a then c[l]=o[l];e[1]=c;end;end;end;end;elseif c>28 then local t;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];c=e[2]n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=d[e[3]];else local o=e[2];local a=e[4];local c=o+2 local o={n[o](n[o+1],n[c])};for e=1,a do n[c+e]=o[e];end;local o=o[1]if o then n[c]=o l=e[3];else l=l+1;end;end;elseif c<=31 then if c==30 then local e=e[2]n[e](n[e+1])else if(n[e[2]]==e[4])then l=l+1;else l=e[3];end;end;elseif c<=32 then n[e[2]][e[3]]=e[4];elseif c==33 then local f=O[e[3]];local a;local c={};a=r({},{__index=function(l,e)local e=c[e];return e[1][e[2]];end,__newindex=function(n,e,l)local e=c[e]e[1][e[2]]=l;end;});for a=1,e[4]do l=l+1;local e=o[l];if e[1]==52 then c[a-1]={n,e[3]};else c[a-1]={t,e[3]};end;i[#i+1]=c;end;n[e[2]]=s(f,a,d);else local c;n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2]n[c](a(n,c+1,e[3]))l=l+1;e=o[l];do return end;end;elseif c<=52 then if c<=43 then if c<=38 then if c<=36 then if c>35 then if n[e[2]]then l=l+1;else l=e[3];end;else local o=e[2];local l=n[e[3]];n[o+1]=l;n[o]=l[e[4]];end;elseif c==37 then n[e[2]][n[e[3]]]=n[e[4]];else local c;n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];c=e[2]n[c](n[c+1])l=l+1;e=o[l];do return end;end;elseif c<=40 then if c>39 then l=e[3];else local t;local c;c=e[2]n[c]=n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];end;elseif c<=41 then n[e[2]][e[3]]=n[e[4]];elseif c==42 then local l=e[2]n[l]=n[l](a(n,l+1,e[3]))else local t;local c;n[e[2]]=d[e[3]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2]n[c]=n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=d[e[3]];end;elseif c<=47 then if c<=45 then if c>44 then n[e[2]][e[3]]=e[4];else n[e[2]]=n[e[3]];end;elseif c==46 then local l=e[2]n[l](a(n,l+1,e[3]))else local t;local c;n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];t=n[e[3]];n[c+1]=t;n[c]=t[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];if not n[e[2]]then l=l+1;else l=e[3];end;end;elseif c<=49 then if c==48 then if n[e[2]]then l=l+1;else l=e[3];end;else n[e[2]]=d[e[3]];end;elseif c<=50 then local e=e[2]local o,l=I(n[e](n[e+1]))f=l+e-1 local l=0;for e=e,f do l=l+1;n[e]=o[l];end;elseif c>51 then n[e[2]]=n[e[3]];else local f=O[e[3]];local a;local c={};a=r({},{__index=function(l,e)local e=c[e];return e[1][e[2]];end,__newindex=function(n,e,l)local e=c[e]e[1][e[2]]=l;end;});for a=1,e[4]do l=l+1;local e=o[l];if e[1]==52 then c[a-1]={n,e[3]};else c[a-1]={t,e[3]};end;i[#i+1]=c;end;n[e[2]]=s(f,a,d);end;elseif c<=61 then if c<=56 then if c<=54 then if c==53 then n[e[2]]=d[e[3]];else local e=e[2]n[e]=n[e](n[e+1])end;elseif c>55 then local a=e[2];local c={};for e=1,#i do local e=i[e];for l=0,#e do local e=e[l];local o=e[1];local l=e[2];if o==n and l>=a then c[l]=o[l];e[1]=c;end;end;end;else local c=e[2];local a=e[4];local o=c+2 local c={n[c](n[c+1],n[o])};for e=1,a do n[o+e]=c[e];end;local c=c[1]if c then n[o]=c l=e[3];else l=l+1;end;end;elseif c<=58 then if c==57 then local o=e[2];local l=n[e[3]];n[o+1]=l;n[o]=l[e[4]];else do return end;end;elseif c<=59 then n[e[2]]=n[e[3]][e[4]];elseif c==60 then n[e[2]]=t[e[3]];else local f;local c;c=e[2]n[c](a(n,c+1,e[3]))l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]={};l=l+1;e=o[l];n[e[2]][n[e[3]]]=n[e[4]];l=l+1;e=o[l];n[e[2]]=t[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]={};l=l+1;e=o[l];n[e[2]][n[e[3]]]=n[e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];f=n[e[3]];n[c+1]=f;n[c]=f[e[4]];l=l+1;e=o[l];c=e[2]n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];c=e[2];f=n[e[3]];n[c+1]=f;n[c]=f[e[4]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](a(n,c+1,e[3]))l=l+1;e=o[l];if not n[e[2]]then l=l+1;else l=e[3];end;end;elseif c<=65 then if c<=63 then if c==62 then if(n[e[2]]~=e[4])then l=l+1;else l=e[3];end;else local l=e[2]n[l]=n[l](a(n,l+1,e[3]))end;elseif c>64 then n[e[2]]={};else n[e[2]]=e[3];end;elseif c<=67 then if c==66 then local c;n[e[2]]=e[3];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];n[e[2]]=(e[3]~=0);l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=e[3];l=l+1;e=o[l];c=e[2]n[c]=n[c](n[c+1])l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=d[e[3]];l=l+1;e=o[l];n[e[2]]=n[e[3]][e[4]];l=l+1;e=o[l];n[e[2]]=n[e[3]];else n[e[2]][e[3]]=n[e[4]];end;elseif c<=68 then local e=e[2]n[e](n[e+1])elseif c>69 then local l=e[2]local c={n[l](a(n,l+1,f))};local o=0;for e=l,e[4]do o=o+1;n[e]=c[o];end else n[e[2]][n[e[3]]]=n[e[4]];end;l=l+1;end;end;end;return s(J(),{},Q())();

Is there a way to do it that actually works because i have googled for hours on how to do it to no success

2 Likes
#2

I have got this far but im stuck on how to break it down but i did get this far on free one i found on google

local d =  string.byte;
local h =  string.char;
local c =  string.sub;
local s =  table.concat;
local e =  table.insert;
local I =  math.ldexp;
local Q =  getfenv or function() return _ENV end;
local r =  setmetatable;
local R =  select;
local a =  unpack or table.unpack;
local i =  tonumber;
local function O(d) local l,
n,
o =  "",
"",
 {}
local t =  256;
local a =  {}
for e =  0,
t -  1 do a[e] =  h(e) end;
local e =  1;
local function f() local l =  i(c(d,  e,  e),  36) e =  e +  1;
local n =  i(c(d,  e,  e +  l -  1),  36) e =  e +  l;
return n end;
l =  h(f()) o[1] =  l;
while e <  #d do local e =  f() if a[e] then n =  a[e]
else n =  l.c(l,  1,  1) end;
a[t] =  l.c(n,  1,  1) o[#o +  1],
l,
t =  n,
n,
t +  1 end;
return table.concat(o) end;
local i =  O('26D25O27525Q25K27525O24R24T24H24P25Q25I27923V24P25424F24P25A25624L24V27E25N27924C24G24T25127M25B25Q27S27525A24P25925524L28325Q25M27925B24V25A24L25825425Q25H27923U25524I24V25424L24J24I27Z25G27927L25428P24I24R27Z26527924E24P25824G27P24T25424P24O24F25424J25A24T24R27E25C27924B24T24L25423U29F23Z24K24L24G24O28927923X28X28727E28J27524B29F24N25B25824T27Q25Q25D27923K24J24V24N27M24324F25125B29A24H25Q28U27523Y24J24O25124825125827E25Q29326Y29X27523K24T24U24P24G27Z25J29Y2A02832B62B824G2AC27924A24L24P25725829F29P29G27D25Q2BC27527U2AA24P24K24J29V27M28027923S24P2AN25A24J2512B425O24C24T28324I28H25L2792A928727Z25E27H27J2C628C24P24I24O24T2CH27Z25R27923P25B23X2AQ27923Y24T25B24P2CE25A28H27827523M27C27E27G27523Z2DG29G2DA28H2BV25O23P2CH27M2AA28P28R25Q25F27926K2BX27X25A24C24J25B29O28Q24I25Q29K27524829G28S2A92CG24V25125P27927921O26R27F2792DK24I23Z2C129724O24P2CZ2BU27T27V2E223X24O2EW29W28125O2ET24I24I24P28O2DX27T2C925024L24H29O25124C2C924H28G28I2792ED24L24R29I28329W2DI25O2CA23V25026W27024Q25524T23V25Q26229Y24O2562CW27Q24O26K2AF2AH27M26K2AL2AN24P24H2EK25O21824V25025D25Q23Y2EA2CP25424B29T29A2972AN2C42BW27V27Q23P24O2CZ27627925Q2CO2DJ24K2CF2DU27M2F32F52H62F828R2FB28O2GQ25O2B12762HG2F82HI29G28O27M2942D828H2A32HY2HJ2I125A2EL25O2F725O26M2IB27526K2IG2HT25O2EK2IK2HD2HT2II2HU2IR2HV2EL2B12IN2IL27925P2F726K25X2IX2752EK26K26N2IX2EK2B125M26L25O2HC2IX2HV26O2IG27526W2JI25O26A2IX2CZ2IW2HT2672HE2642D024I2E724T2972522D92FN2FP25W2GZ2FM24J2AZ2DB25129S2CW29I29C2FT24I2JY2772FR24P27C2HO2F92HR28H2JS27523T28528F2AZ24O23X24V27Q25B25B29F2BM27Z2DD25O2DF2BT2JU27524F24T25629B2KX2KZ2L128E2C72HF2EQ2HZ2HK25A2HM29B2KI2A429N2DC2792572LT2IW2EN2FQ2HH2I829A25A2G928K24L2CU23U2CM25429S29U24O2H127P24K2D12D32CJ2LA29T2DB2D427523N29V24F2MM28H2AD2ML2872542482GO29629927E2MK2CD2CW25428T2792MQ24O2CE2CX2BJ2BW2N625B2MZ2FO27V29A2IT2HT25Q2L92DQ2JW28P2JY24L2K02K62FO2542IB2N425O26I2JI2IQ2EL2IK2IM2JL2IV2IJ2792I62M02I72I02M32M52752M92M82MA2MC29V2MF24V2MH2D225Q2N42MS2MX25Q2KQ25O2KS2862582KV2LF2C72LH2L32LR2L62DG2MO25O2NA2OU2MN2MV25O2PD2MY2N02NK2N327T2NG2PA2NA2NC2N72IB26C2EL2DY2IG2O42IY25O2PX2HD2662HD2JE2IB2B12JA2EL2JS2HT25K2PT2752Q92752632PY2IH2EB2792L52J32DZ2J42IX2O02O52QR2EL2IQ2O72J52QO2J925O2Q22JD2R12IB2EK2EY2PZ2QX2IC25O2NP25O28A2GQ2QG2PW26B2R32R62Q52QZ2HD2AR2IG2Q62RB2EL25Z2J825O2QB2792RR2EK2RU27526J2J32RE2QM26K2QJ2752QL2IN2QU2QP2JL2O62IB2S92O72SE2IR2R02CZ2RM2PY2R52SG27S2RA28J2JQ2IY23T2EL2CJ2S82R72IK2IT2RH2O92S92Q12752CZ2Q42QO2SM2R72782JB2R22JF2752JH2JI2JK2JI26P2JO2QM2TL2RI2O72CJ2IQ2IT28A2792T62PY2B12Q42SW2RS27S2TQ2792TS2T42SB2IR2CZ2T225O28U2SG2I62TD2EK2R02EK2FY2R02B12DP2TV2IX2U829K2SG2AD2SI25O2HX2SL2IR2TS2EK2J72O72RY25O2UY2RT2QC25O2692S12TM26K2Q22TO2RI2TR2QR2QY2U12752UO2HD2B12UQ2S62US2RN2RT2IR2U12B12JU2L92EK2DY2B12J12QM2UO2V22EK2UQ2922CZ29227926E2TK2JA2O72JK2UZ2V42WC2V327926Q2V72S82VA2SA2VG2RP2PY2VF2HD2VH2VC2IR2VL2VP2W62IU2VP2VX2VJ25O2JS2VU2RK2VX2J22HT2UA2W12VP2TB2JP2TD25O2TH2IG2TF2IG2JN2R42TM2QM2NN2PV2CD2K22MY28E2FU27M29B2O52U325O27G2TY2QV2WY2IW2TU2T72XM2IK2NY27526626F2QH2RI2WY2UI2TC2RJ2B12UF2VP2YA2HD2N42VR2WO2QO2RO2YG2L52UR2YO2J22T52R825O2S02RO2YJ2U42IP2U42SJ2RI2YY28J2R02CJ2FY2TT25O2CJ2Z32VP2Z52VP2782BC2IQ2782782ZA27528A2S52W82TA2VQ2J22ZG25O2AD26I2WI2CJ25Y2IX2CO2V031042RX2V42XK2QZ26X2ZF310E2IH25T310E2CJ28A2IQ2CJ2CJ2DY310L310E2JU310P2CJ292310S25O2ZQ2R82R02SU2R82X0310I2X231102O92ZB310F2PZ2J7310M310W2QZ27S27S310Z2792CJ27S2ZH28A2YO2ZR2RP310K311N28A310O311Q2R92RI28A28A2922L92CJ2602RP266310D2CJ2612DZ2J728A2782GA25O2722RP2ID2B12N427S2V02ST2J52J727G28J2QG26629229K2K42W72XZ25O29K2WA312V26T2RS2V0313031092792TJ2J52J2312N25O2J226I25V312V313625O31042V0313F2V023Z2UM3138311C313B2WI27G313L2EK2RR313K313M312V28J313B313D27G312K25O25S2WG2KR2IX2702II28J310H25U25O3148311C313D2II25M26Z310E2732TD2V0314L313731182JC2J631132IF2TB2F72O72XF2YD2JM310E27S314P2N4314R311A310E314U2JC31522RS314Y2QO2792AD311I2IX311731262IH311N312A2EL28A2ID275312H2YL27524U2UM312M311C312P312R2V12EL2W827G312X2RB26G312V24T2QM2V03168314P31393166314S27G27G3158312W2IR2QY315C2TL2XG2UC2JN31632J326S2U92IB314I310E24A314M2V4316Y2UE3124311826623Y2RP26H2792R027S2O22IB28U2HT2R028J2YU27527G2S02IB28J2RO2IQ31392PT2R02BC2ZJ2BC2BC27427929K2O02682ZZ2YQ25O31812CO2ID31812DY2SK316Q25O2DY2SR275');
local o =  bit and bit.bxor or function(e,  l) local n,
o =  1,
0
while e >  0 and l >  0 do local a,
c =  e %  2,
l %  2
if a~ =  c then o =  o +  n end e,
l,
n =  (e -  a) /  2,
(l -  c) /  2,
n *  2 end
if e <  l then e =  l end
while e >  0 do local l =  e %  2
if l >  0 then o =  o +  n end e,
n =  (e -  l) /  2,
n *  2 end
return o end local function n(l,  e,  n) if n then local e =  (l /  2 ^  (e -  1)) %  2 ^  (
(n -  1) -  (e -  1) +  1);
return e -  e %  1;
else local e =  2 ^  (e -  1);
return (l %  (e +  e) >=  e) and 1 or 0;
end;
end;
local e =  1;
local function l() local c,
l,
n,
a =  d(i,  e,  e +  3);
c =  o(c,  204) l =  o(l,  204) n =  o(n,  204) a =  o(a,  204) e =  e +  4;
return (a *  16777216) +  (n *  65536) +  (l *  256) +  c;
end;
local function f() local l =  o(d(i,  e,  e),  204);
e =  e +  1;
return l;
end;
local function t() local l,
n =  d(i,  e,  e +  2);
l =  o(l,  204) n =  o(n,  204) e =  e +  2;
return (n *  256) +  l;
end;
local function C() local o =  l();
local e =  l();
local c =  1;
local o =  (n(e,  1,  20) *  (2 ^  32)) +  o;
local l =  n(e,  21,  31);
local e =  (
(-1) ^  n(e,  32));
if (l ==  0) then
if (o ==  0) then
return e *  0;
else l =  1;
c =  0;
end;
elseif(l ==  2047) then
return (o ==  0) and(e *  (1 /  0)) or(e *  (0 /  0));
end;
return I(e,  l -  1023) *  (c +  (o /  (2 ^  52)));
end;
local I =  l;
local function O(l) local n;
if (not l) then l =  I();
if (l ==  0) then
return '';
end;
end;
n =  c(i,  e,  e +  l -  1);
e =  e +  l;
local l =  {}
for e =  1,
#n do l[e] =  h(o(d(c(n,  e,  e)),  204)) end
return s(l);
end;
local e =  l;
local function h(.) return {},
R('#',  .) end local function J() local d =  {};
local c =  {};
local e =  {};
local i =  {};
local e =  l() local o =  {}
for n =  1,
e do local l =  f();
local e;
if (l ==  3) then e =  (f()~ =  0);
elseif(l ==  1) then e =  C();
elseif(l ==  2) then e =  O();
end;
o[n] =  e;
end;
for e =  1,
l() do c[e -  1] =  J();
end;
i[3] =  f();
for i =  1,
l() do local e =  f();
if (n(e,  1,  1) ==  0) then local c =  n(e,  2,  3);
local a =  n(e,  4,  6);
local e =  {};
if (c ==  0) then e[3] =  t();
e[4] =  t();
elseif(c ==  1) then e[3] =  l();
elseif(c ==  2) then e[3] =  l() -  (2 ^  16) elseif(c ==  3) then e[3] =  l() -  (2 ^  16) e[4] =  t();
end;
if (n(a,  1,  1) ==  1) then e[2] =  o[e[2]] end
if (n(a,  2,  2) ==  1) then e[3] =  o[e[3]] end
if (n(a,  3,  3) ==  1) then e[4] =  o[e[4]] end d[i] =  e;
end end;
return i;
end;
local function s(e,  t,  d) local n =  e[1];
local l =  e[2];
local e =  e[3];
return function(.) local o =  n;
local O =  l;
local c =  e;
local I =  h local l =  1;
local f =  -  1;
local Q =  {};
local J =  {};
local h =  R('#',  .) -  1;
local i =  {};
local n =  {};
for e =  0,
h do
if (e >=  c) then Q[e -  c] =  J[e +  1];
else n[e] =  J[e +  1];
end;
end;
local e =  h -  c +  1 local e;
local c;
while true do e =  o[l];
c =  e[1];
if c <=  34 then
if c <=  16 then
if c <=  7 then
if c <=  3 then
if c <=  1 then
if c >  0 then
if not n[e[2]] then l =  l +  1;
else l =  e[3];
end;
else do
return end;
end;
elseif c >  2 then l =  e[3];
else local o =  e[2] local c =  {};
local l =  0;
for e =  o,
e[4] do l =  l +  1;
n[e] =  c[l];
end end;
elseif c <=  5 then
if c >  4 then local d;
local c;
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
c =  e[2];
d =  n[e[3]];
n[c +  1] =  d;
n[c] =  d[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
c =  e[2];
d =  n[e[3]];
n[c +  1] =  d;
n[c] =  d[e[4]];
else local e =  e[2] n[e] =  n[e]
(n[e +  1]) end;
elseif c >  6 then local c;
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]]
[e[3]] =  n[e[4]];
else
if (n[e[2]]~ =  e[4]) then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  11 then
if c <=  9 then
if c ==  8 then local d;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[n[e[4]]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
d =  n[e[3]];
n[c +  1] =  d;
n[c] =  d[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]]
[e[3]] =  n[e[4]];
else
if not n[e[2]] then l =  l +  1;
else l =  e[3];
end;
end;
elseif c ==  10 then local c;
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
do
return end;
else
if (n[e[2]] ==  e[4]) then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  13 then
if c ==  12 then local d;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[n[e[4]]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
d =  n[e[3]];
n[c +  1] =  d;
n[c] =  d[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]]
[e[3]] =  n[e[4]];
else local c;
local t;
local i,
s;
local h;
local c;
c =  e[2] n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
c =  e[2];
h =  n[e[3]];
n[c +  1] =  h;
n[c] =  h[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2] i,
s =  I(n[c]
(n[c +  1])) f =  s +  c -  1 t =  0;
for e =  c,
f do t =  t +  1;
n[e] =  i[t];
end;
l =  l +  1;
e =  o[l];
c =  e[2] i =  {};
t =  0;
for e =  c,
e[4] do t =  t +  1;
n[e] =  i[t];
end l =  l +  1;
e =  o[l];
l =  e[3];
end;
elseif c <=  14 then n[e[2]] =  (e[3]~ =  0);
elseif c >  15 then n[e[2]] =  n[e[3]]
[n[e[4]]];
else local d;
local c;
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
d =  n[e[3]];
n[c +  1] =  d;
n[c] =  d[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
if n[e[2]] then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  25 then
if c <=  20 then
if c <=  18 then
if c ==  17 then n[e[2]] =  e[3];
else local t;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[n[e[4]]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]]
[e[3]] =  n[e[4]];
end;
elseif c >  19 then local e =  e[2] local o,
l =  I(n[e]
(n[e +  1])) f =  l +  e -  1 local l =  0;
for e =  e,
f do l =  l +  1;
n[e] =  o[l];
end;
else n[e[2]] =  n[e[3]]
[n[e[4]]];
end;
elseif c <=  22 then
if c >  21 then local l =  e[2] n[l]
(a(n,  l +  1,  e[3]))
else local t;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[n[e[4]]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]]
[e[3]] =  n[e[4]];
end;
elseif c <=  23 then n[e[2]] =  t[e[3]];
elseif c ==  24 then n[e[2]] =  (e[3]~ =  0);
else n[e[2]] =  n[e[3]]
[e[4]];
end;
elseif c <=  29 then
if c <=  27 then
if c ==  26 then n[e[2]] =  {};
else local a =  e[2];
local c =  {};
for e =  1,
#i do local e =  i[e];
for l =  0,
#e do local e =  e[l];
local o =  e[1];
local l =  e[2];
if o ==  n and l >=  a then c[l] =  o[l];
e[1] =  c;
end;
end;
end;
end;
elseif c >  28 then local t;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
else local o =  e[2];
local a =  e[4];
local c =  o +  2 local o =  {};
for e =  1,
a do n[c +  e] =  o[e];
end;
local o =  o[1]
if o then n[c] =  o l =  e[3];
else l =  l +  1;
end;
end;
elseif c <=  31 then
if c ==  30 then local e =  e[2] n[e]
(n[e +  1])
else
if (n[e[2]] ==  e[4]) then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  32 then n[e[2]]
[e[3]] =  e[4];
elseif c ==  33 then local f =  O[e[3]];
local a;
local c =  {};
a =  r( {},
 {});
for a =  1,
e[4] do l =  l +  1;
local e =  o[l];
if e[1] ==  52 then c[a -  1] =  {};
else c[a -  1] =  {};
end;
i[#i +  1] =  c;
end;
n[e[2]] =  s(f,  a,  d);
else local c;
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
do
return end;
end;
elseif c <=  52 then
if c <=  43 then
if c <=  38 then
if c <=  36 then
if c >  35 then
if n[e[2]] then l =  l +  1;
else l =  e[3];
end;
else local o =  e[2];
local l =  n[e[3]];
n[o +  1] =  l;
n[o] =  l[e[4]];
end;
elseif c ==  37 then n[e[2]]
[n[e[3]]] =  n[e[4]];
else local c;
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
do
return end;
end;
elseif c <=  40 then
if c >  39 then l =  e[3];
else local t;
local c;
c =  e[2] n[c] =  n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
end;
elseif c <=  41 then n[e[2]]
[e[3]] =  n[e[4]];
elseif c ==  42 then local l =  e[2] n[l] =  n[l]
(a(n,  l +  1,  e[3]))
else local t;
local c;
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
end;
elseif c <=  47 then
if c <=  45 then
if c >  44 then n[e[2]]
[e[3]] =  e[4];
else n[e[2]] =  n[e[3]];
end;
elseif c ==  46 then local l =  e[2] n[l]
(a(n,  l +  1,  e[3]))
else local t;
local c;
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
t =  n[e[3]];
n[c +  1] =  t;
n[c] =  t[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
if not n[e[2]] then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  49 then
if c ==  48 then
if n[e[2]] then l =  l +  1;
else l =  e[3];
end;
else n[e[2]] =  d[e[3]];
end;
elseif c <=  50 then local e =  e[2] local o,
l =  I(n[e]
(n[e +  1])) f =  l +  e -  1 local l =  0;
for e =  e,
f do l =  l +  1;
n[e] =  o[l];
end;
elseif c >  51 then n[e[2]] =  n[e[3]];
else local f =  O[e[3]];
local a;
local c =  {};
a =  r( {},
 {});
for a =  1,
e[4] do l =  l +  1;
local e =  o[l];
if e[1] ==  52 then c[a -  1] =  {};
else c[a -  1] =  {};
end;
i[#i +  1] =  c;
end;
n[e[2]] =  s(f,  a,  d);
end;
elseif c <=  61 then
if c <=  56 then
if c <=  54 then
if c ==  53 then n[e[2]] =  d[e[3]];
else local e =  e[2] n[e] =  n[e]
(n[e +  1]) end;
elseif c >  55 then local a =  e[2];
local c =  {};
for e =  1,
#i do local e =  i[e];
for l =  0,
#e do local e =  e[l];
local o =  e[1];
local l =  e[2];
if o ==  n and l >=  a then c[l] =  o[l];
e[1] =  c;
end;
end;
end;
else local c =  e[2];
local a =  e[4];
local o =  c +  2 local c =  {};
for e =  1,
a do n[o +  e] =  c[e];
end;
local c =  c[1]
if c then n[o] =  c l =  e[3];
else l =  l +  1;
end;
end;
elseif c <=  58 then
if c ==  57 then local o =  e[2];
local l =  n[e[3]];
n[o +  1] =  l;
n[o] =  l[e[4]];
else do
return end;
end;
elseif c <=  59 then n[e[2]] =  n[e[3]]
[e[4]];
elseif c ==  60 then n[e[2]] =  t[e[3]];
else local f;
local c;
c =  e[2] n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  {};
l =  l +  1;
e =  o[l];
n[e[2]]
[n[e[3]]] =  n[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  t[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  {};
l =  l +  1;
e =  o[l];
n[e[2]]
[n[e[3]]] =  n[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
f =  n[e[3]];
n[c +  1] =  f;
n[c] =  f[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
c =  e[2];
f =  n[e[3]];
n[c +  1] =  f;
n[c] =  f[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(a(n,  c +  1,  e[3])) l =  l +  1;
e =  o[l];
if not n[e[2]] then l =  l +  1;
else l =  e[3];
end;
end;
elseif c <=  65 then
if c <=  63 then
if c ==  62 then
if (n[e[2]]~ =  e[4]) then l =  l +  1;
else l =  e[3];
end;
else local l =  e[2] n[l] =  n[l]
(a(n,  l +  1,  e[3])) end;
elseif c >  64 then n[e[2]] =  {};
else n[e[2]] =  e[3];
end;
elseif c <=  67 then
if c ==  66 then local c;
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
n[e[2]] =  (e[3]~ =  0);
l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  e[3];
l =  l +  1;
e =  o[l];
c =  e[2] n[c] =  n[c]
(n[c +  1]) l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  d[e[3]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]]
[e[4]];
l =  l +  1;
e =  o[l];
n[e[2]] =  n[e[3]];
else n[e[2]]
[e[3]] =  n[e[4]];
end;
elseif c <=  68 then local e =  e[2] n[e]
(n[e +  1]) elseif c >  69 then local l =  e[2] local c =  {};
local o =  0;
for e =  l,
e[4] do o =  o +  1;
n[e] =  c[o];
end
else n[e[2]]
[n[e[3]]] =  n[e[4]];
end;
l =  l +  1;
end;
end;
end;
return s(J(),  {},
Q())
();
 {}
#3

And this code work fine when you use it with the good team names? Because if it is the case, this means that the code you have is “encrypted”. So fix it can be impossible or take some several hours of work even for a guy like me who has been coding on roblox for almost 10 years. I doubt anyone can help you unless they have lots and lots of free time and are really hardcore at programming.

The best advice I can give you is to never buy from this person again, because the code provided here is catastrophic.

If you tell me exactly what you’re looking to create, I might be able to guide you on how to get there.

#4

This is the exact system I thought I was buying and I ended getting something completely different for exampe my screen shot i just took

Screenshot (47)
Screenshot (47)1920×1080 164 KB

Advanced locker system

#5

Its crazy i spent 1500 robux for something completly different than what it wanted @NiniScripterXQc

#6

Of my point of view, you seem to have been deceived by this user. The best thing to do is to report it.

I don’t know if you can get a refund. If you bought this with Robux, Roblox support might be able to help you. They may initially claim that you intentionally purchased this product, but explaining that you were deceived and, therefore, scammed may work in your favor.

I’m sorry that you were disappointed like this; it’s shameful to see users taking advantage of others in this way.

1 Like
#7

Roblox should come up with something to reverse this… like a plugin if you have the license for it you can get it so it protects people both ways the creator and the purchaser

#8

Yeah, that’s an interesting idea. If roblox allows us the posibility to sell models on the marketplace by adding images and/or videos to fully describe what you are looking to sell, this could facilitate scam detection and therefore reimbursement as well.

1 Like
#11

Groups often obfuscate their code as it contains some kind of license checker preventing people from reselling and/or leaking, as only the one game is whitelisted. But if you’re purchasing this directly off a person then that shouldn’t be the case. If you’ve paid them to make this for you specifically you should be allowed to resell and do what you like with it. Just a thought

1 Like
#12

No i bought it off one of the hubs im trying to get a ticket open to get the code for it now but im suprised there is no way to reverse this other than to spend hours decoding it and a college degree lol

#13

Isn’t obfuscated code not even allowed on Roblox?

2 Likes
#14

Yeah if you bought it off a hub then you won’t be getting the source code off them. What product were you buying? Depending on what it is you could probably find a developer who can make one for you

#15

As others have probably said obfuscated code is against TOS, so you should probably report it. There are methods for de-obfuscating code in general but they are complicated. If you can research and figure out how this was obfuscated then the same tool should have a way to de-obfuscate.

#16

surface level google suggests its probably this tool: https://luaobfuscator.com

#17

Found this in another post

#18

Its only illegal if youpublish it that way to the public other than that obfuscated scripts are not against tos to use in your personal game

#19

Greetings,

We tried to assist you and even offered live team create support in an attempt at making our system compatible with Xbox as you requested, even though it was not included in the initial product, yet you appeared to shun us away and showed nothing little of disrespect. We appreciate you shopping with us, however leaking and trying to deobfuscate the code included in our product goes strictly against our terms of use, and as a result, your license has been revoked.

The product not working is not a direct result of bugs caused in the code, but rather your lack of judgment when setting up the product that resulted in this. The product was designed to be set up with little to no effort and great ease so I am amazed at this mess up. We gave you numerous opportunities for a full refund, yet you insisted on receiving the source code which simply is not sustainable for us long-term.

We would like to note that obfuscated code on its own does not constitute a violation of the Roblox ToS unless it is used with malicious intent, for example fabricating server-sided exploits and such.

Again, thank you for shopping with us and we hope you understand our side of the
story.

exavein - Chief Marketing, Communications, Administrative & Operating Officer.

(Refund not applicable due to violation of ToS)

2 Likes
#20

The product he purchased was directly from our hub, the code is hidden as we mass distribute the product and hand out whitelists to customers. Many leakers and or other companies tend to distribute products which aren’t rightfully theirs hence the obfuscation.

1 Like
#21

It will be excepted its against your terms of service but if your product is not what you claim it to be nothing ever said it cant be used on xbox also calling me a r tard for not setting it up right when i did and am using it now in my game its on your end brother not me dont worry reported you to roblox and also to discord and also flagged your post for hurrasement you call me names on discord and then ban me you never ofrered helped you all called me n words r tard rhe list

#22

And i will be getting a refund and have you suspended for hurrasment trust me i got pics and screen shots