KeylessUniversal
Executor Crowdsourced Map
Fallden4 1 year ago 4.1K viewsRun it
Copy the script and paste it into your executor.
Executor Crowdsourced Map.lua · 476 lines
StrToNumber = ;
Byte = .byte;
Char = .char;
Sub = .sub;
Subg = .gsub;
Rep = .rep;
Concat = .concat;
Insert = .insert;
LDExp = .ldexp;
GetFEnv = getfenv ()
_ENV;
;
Setmetatable = ;
PCall = ;
Select = ;
Unpack = .unpack;
ToNumber = ;
(ByteString, vmenv, ...)
DIP = ;
repeatNext;
ByteString = ((ByteString, ), , (byte)
((byte, ) == )
repeatNext = ((byte, , ));
;
a = ((byte, ));
repeatNext
b = (a, repeatNext);
repeatNext = ;
b;
a;
);
(Bit, Start, End)
End
Res = (Bit / ( ^ (Start - ))) % ( ^ (((End - ) - (Start - )) + ));
Res - (Res % );
Plc = ^ (Start - );
(((Bit % (Plc + Plc)) >= Plc) ) ;
()
a = (ByteString, DIP, DIP);
DIP = DIP + ;
a;
()
a, b = (ByteString, DIP, DIP + );
DIP = DIP + ;
(b * ) + a;
()
a, b, c, d = (ByteString, DIP, DIP + );
DIP = DIP + ;
(d * ) + (c * ) + (b * ) + a;
()
Left = ();
Right = ();
IsNormal = ;
Mantissa = ((Right, , ) * ( ^ )) + Left;
Exponent = (Right, , );
Sign = (((Right, ) == ) -) ;
(Exponent == )
(Mantissa == )
Sign * ;
Exponent = ;
IsNormal = ;
(Exponent == )
((Mantissa == ) (Sign * ( / ))) (Sign * NaN);
(Sign, Exponent - ) * (IsNormal + (Mantissa / ( ^ )));
(Len)
Str;
Len
Len = ();
(Len == )
;
Str = (ByteString, DIP, (DIP + Len) - );
DIP = DIP + Len;
FStr = {};
Idx = , #Str
FStr[Idx] = (((Str, Idx, Idx)));
(FStr);
gInt = gBits32;
(...)
{...}, (, ...);
()
Instrs = {};
Functions = {};
Lines = {};
Chunk = {Instrs,Functions,,Lines};
ConstCount = ();
Consts = {};
Idx = , ConstCount
Type = ();
Cons;
(Type == )
Cons = () ~= ;
(Type == )
Cons = ();
(Type == )
Cons = ();
Consts[Idx] = Cons;
Chunk[] = ();
Idx = , ()
Descriptor = ();
((Descriptor, , ) == )
Type = (Descriptor, , );
Mask = (Descriptor, , );
Inst = {(),(),,};
(Type == )
Inst[] = ();
Inst[] = ();
(Type == )
Inst[] = ();
(Type == )
Inst[] = () - ( ^ );
(Type == )
Inst[] = () - ( ^ );
Inst[] = ();
((Mask, , ) == )
Inst[] = Consts[Inst[]];
((Mask, , ) == )
Inst[] = Consts[Inst[]];
((Mask, , ) == )
Inst[] = Consts[Inst[]];
Instrs[Idx] = Inst;
Idx = , ()
Functions[Idx - ] = ();
Chunk;
(Chunk, Upvalues, Env)
Instr = Chunk[];
Proto = Chunk[];
Params = Chunk[];
(...)
Instr = Instr;
Proto = Proto;
Params = Params;
_R = _R;
VIP = ;
Top = -;
Vararg = {};
Args = {...};
PCount = (, ...) - ;
Lupvals = {};
Stk = {};
Idx = , PCount
(Idx >= Params)
Vararg[Idx - Params] = Args[Idx + ];
Stk[Idx] = Args[Idx + ];
Varargsz = (PCount - Params) + ;
Inst;
;
Inst = Instr[VIP];
= Inst[];
( <= )
( <= )
( <= )
( <= )
( <= )
A = Inst[];
Stk[A] = Stk[A]((Stk, A + , Inst[]));
( > )
A = Inst[];
(Stk, A, Top);
Stk[Inst[]] = Stk[Inst[]][Inst[]];
( <= )
Stk[Inst[]]
VIP = VIP + ;
VIP = Inst[];
( > )
A = Inst[];
(Stk, A, A + Inst[]);
Stk[Inst[]] = Upvalues[Inst[]];
( <= )
( <= )
Stk[Inst[]][Inst[]] = Stk[Inst[]];
( > )
Stk[Inst[]][Inst[]] = Inst[];
Stk[Inst[]] = {};
( <= )
( > )
A = Inst[];
Stk[A] = Stk[A](Stk[A + ]);
Stk[Inst[]] = Stk[Inst[]][Inst[]];
( > )
NewProto = Proto[Inst[]];
NewUvals;
Indexes = {};
NewUvals = ({}, {__index=(_, Key)
Val = Indexes[Key];
Val[][Val[]];
,__newindex=(_, Key, Value)
Val = Indexes[Key];
Val[][Val[]] = Value;
});
Idx = , Inst[]
VIP = VIP + ;
Mvm = Instr[VIP];
(Mvm[] == )
Indexes[Idx - ] = {Stk,Mvm[]};
Indexes[Idx - ] = {Upvalues,Mvm[]};
Lupvals[#Lupvals + ] = Indexes;
Stk[Inst[]] = (NewProto, NewUvals, Env);
A = Inst[];
B = Stk[Inst[]];
Stk[A + ] = B;
Stk[A] = B[Inst[]];
( <= )
( <= )
( <= )
A = Inst[];
Stk[A](Stk[A + ]);
( > )
VIP = Inst[];
A = Inst[];
Stk[A] = Stk[A]();
( <= )
A = Inst[];
(Stk, A, Top);
( == )
(Stk[Inst[]] ~= Inst[])
VIP = VIP + ;
VIP = Inst[];
Stk[Inst[]]
VIP = VIP + ;
VIP = Inst[];
( <= )
( <= )
A = Inst[];
Results = {Stk[A](Stk[A + ])};
Edx = ;
Idx = A, Inst[]
Edx = Edx + ;
Stk[Idx] = Results[Edx];
( == )
B = Inst[];
K = Stk[B];
Idx = B + , Inst[]
K = K .. Stk[Idx];
Stk[Inst[]] = K;
Stk[Inst[]] = Env[Inst[]];
( <= )
( == )
A = Inst[];
Stk[A] = Stk[A]();
;
( == )
Stk[Inst[]];
Stk[Inst[]] = {};
( <= )
( <= )
( <= )
( <= )
B = Inst[];
K = Stk[B];
Idx = B + , Inst[]
K = K .. Stk[Idx];
Stk[Inst[]] = K;
( > )
Stk[Inst[]] = Inst[];
;
( <= )
A = Inst[];
Stk[A]((Stk, A + , Inst[]));
( > )
Stk[Inst[]] = Env[Inst[]];
A = Inst[];
Stk[A] = Stk[A]((Stk, A + , Inst[]));
( <= )
( <= )
A = Inst[];
Stk[A](Stk[A + ]);
( > )
Stk[Inst[]][Inst[]] = Stk[Inst[]];
Stk[Inst[]] = (Proto[Inst[]], , Env);
( <= )
( == )
A = Inst[];
Stk[A]((Stk, A + , Inst[]));
VIP = Inst[];
( > )
Stk[Inst[]] = Stk[Inst[]];
Stk[Inst[]]
VIP = VIP + ;
VIP = Inst[];
( <= )
( <= )
( <= )
Stk[Inst[]]
VIP = VIP + ;
VIP = Inst[];
( == )
A = Inst[];
B = Stk[Inst[]];
Stk[A + ] = B;
Stk[A] = B[Inst[]];
Stk[Inst[]][Inst[]] = Inst[];
( <= )
( > )
A = Inst[];
Results = {Stk[A](Stk[A + ])};
Edx = ;
Idx = A, Inst[]
Edx = Edx + ;
Stk[Idx] = Results[Edx];
Stk[Inst[]] = Inst[];
( > )
Stk[Inst[]] = Upvalues[Inst[]];
A = Inst[];
Stk[A] = Stk[A](Stk[A + ]);
( <= )
( <= )
(Stk[Inst[]] ~= Inst[])
VIP = VIP + ;
VIP = Inst[];
( == )
NewProto = Proto[Inst[]];
NewUvals;
Indexes = {};
NewUvals = ({}, {__index=(_, Key)
Val = Indexes[Key];
Val[][Val[]];
,__newindex=(_, Key, Value)
Val = Indexes[Key];
Val[][Val[]] = Value;
});
Idx = , Inst[]
VIP = VIP + ;
Mvm = Instr[VIP];
(Mvm[] == )
Indexes[Idx - ] = {Stk,Mvm[]};
Indexes[Idx - ] = {Upvalues,Mvm[]};
Lupvals[#Lupvals + ] = Indexes;
Stk[Inst[]] = (NewProto, NewUvals, Env);
Stk[Inst[]] = (Proto[Inst[]], , Env);
( <= )
( == )
A = Inst[];
Stk[A]((Stk, A + , Inst[]));
Stk[Inst[]] = Stk[Inst[]];
( == )
Stk[Inst[]];
A = Inst[];
Stk[A]((Stk, A + , Inst[]));
VIP = VIP + ;
;
((), {}, vmenv)(...);
(, (), ...);Obfuscated. The code is scrambled, so you can't read what it does. Common for key systems, but take care.
About this script
Logs your relative location and executor. This is to create a map of the most popular executor in areas!
