1 | --[[ |
2 | @lulaslollipop π on RBX // diskord @rrixh // telegram: https://t.me/sIipped |
3 | |
4 | βββββββββββββββββββββββββββββββββββββ |
5 | βββββββββββββββββββββββββββββββββββββ |
6 | βββββββββββββββββββββββββββββββββββββ |
7 | βββββββββββββββββββββββββββββββββββββ |
8 | βββββββββββββββββββββββββββββββββββββ |
9 | βββββββββββββββββββββββββββββββββββββ |
10 | |
11 | ββββββββββββββββββββββββββββ |
12 | ββββββββββββββββββββββββββββ |
13 | ββββββββββββββββββββββββββββ |
14 | ββββββββββββββββββββββββββββ |
15 | ββββββββββββββββββββββββββββ |
16 | ββββββββββββββββββββββββββββ |
17 | Type("wassup this is a test funktion", 4, 255,255,255) |
18 | |
19 | --[[ how to use: |
20 | 1. put the loadstring first |
21 | 2. Type('Your Notifikation Text' DurationHere, RGBKolorKodeHere) |
22 | |
23 | example: |
24 | Type('this is a notif', 5, 255,0,0) |
25 | |
26 | the notif text would be red kuz (255,0,0) Red-255, Green-0, Blue-0 |
27 | OR just leave it at *255,255,255*(white) if u dont know what yo ass doing |
28 | ]]-- |
29 | lulaslollipop,RRixh,IuIasIoIIipop,haha,x,y=[[kreator]],[[fuxk u doing here]],{{},{},{},{},{}},[[πΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊπΊ]],[[YOU A BITXH FOR LOOKING HERE PUSSYSYYPUSSYPUSSYYY]],[[ugly assnnigga]] |
30 | local StrToNumber = tonumber; |
31 | local Byte = string.byte; |
32 | local Char = string.char; |
33 | local Sub = string.sub; |
34 | local Subg = string.gsub; |
35 | local Rep = string.rep; |
36 | local Concat = table.concat; |
37 | local Insert = table.insert; |
38 | local LDExp = math.ldexp; |
39 | local GetFEnv = getfenv or function() |
40 | return _ENV; |
41 | end; |
42 | local Setmetatable = setmetatable; |
43 | local PCall = pcall; |
44 | local Select = select; |
45 | local Unpack = unpack or table.unpack; |
46 | local ToNumber = tonumber; |
47 | local function VMCall(ByteString, vmenv, ...) |
48 | local DIP = 1; |
49 | local repeatNext; |
50 | ByteString = Subg(Sub(ByteString, 5), "..", function(byte) |
51 | if (Byte(byte, 2) == 79) then |
52 | repeatNext = StrToNumber(Sub(byte, 1, 1)); |
53 | return ""; |
54 | else |
55 | local a = Char(StrToNumber(byte, 16)); |
56 | if repeatNext then |
57 | local b = Rep(a, repeatNext); |
58 | repeatNext = nil; |
59 | return b; |
60 | else |
61 | return a; |
62 | end |
63 | end |
64 | end); |
65 | local function gBit(Bit, Start, End) |
66 | if End then |
67 | local Res = (Bit / (2 ^ (Start - 1))) % (2 ^ (((End - 1) - (Start - 1)) + 1)); |
68 | return Res - (Res % 1); |
69 | else |
70 | local Plc = 2 ^ (Start - 1); |
71 | return (((Bit % (Plc + Plc)) >= Plc) and 1) or 0; |
72 | end |
73 | end |
74 | local function gBits8() |
75 | local a = Byte(ByteString, DIP, DIP); |
76 | DIP = DIP + 1; |
77 | return a; |
78 | end |
79 | local function gBits16() |
80 | local a, b = Byte(ByteString, DIP, DIP + 2); |
81 | DIP = DIP + 2; |
82 | return (b * 256) + a; |
83 | end |
84 | local function gBits32() |
85 | local a, b, c, d = Byte(ByteString, DIP, DIP + 3); |
86 | DIP = DIP + 4; |
87 | return (d * 16777216) + (c * 65536) + (b * 256) + a; |
88 | end |
89 | local function gFloat() |
90 | local Left = gBits32(); |
91 | local Right = gBits32(); |
92 | local IsNormal = 1; |
93 | local Mantissa = (gBit(Right, 1, 20) * (2 ^ 32)) + Left; |
94 | local Exponent = gBit(Right, 21, 31); |
95 | local Sign = ((gBit(Right, 32) == 1) and -1) or 1; |
96 | if (Exponent == 0) then |
97 | if (Mantissa == 0) then |
98 | return Sign * 0; |
99 | else |
100 | Exponent = 1; |
101 | IsNormal = 0; |
102 | end |
103 | elseif (Exponent == 2047) then |
104 | return ((Mantissa == 0) and (Sign * (1 / 0))) or (Sign * NaN); |
105 | end |
106 | return LDExp(Sign, Exponent - 1023) * (IsNormal + (Mantissa / (2 ^ 52))); |
107 | end |
108 | local function gString(Len) |
109 | local Str; |
110 | if not Len then |
111 | Len = gBits32(); |
112 | if (Len == 0) then |
113 | return ""; |
114 | end |
115 | end |
116 | Str = Sub(ByteString, DIP, (DIP + Len) - 1); |
117 | DIP = DIP + Len; |
118 | local FStr = {}; |
119 | for Idx = 1, #Str do |
120 | FStr[Idx] = Char(Byte(Sub(Str, Idx, Idx))); |
121 | end |
122 | return Concat(FStr); |
123 | end |
124 | local gInt = gBits32; |
125 | local function _R(...) |
126 | return {...}, Select("#", ...); |
127 | end |
128 | local function Deserialize() |
129 | local Instrs = {}; |
130 | local Functions = {}; |
131 | local Lines = {}; |
132 | local Chunk = {Instrs,Functions,nil,Lines}; |
133 | local ConstCount = gBits32(); |
134 | local Consts = {}; |
135 | for Idx = 1, ConstCount do |
136 | local Type = gBits8(); |
137 | local Cons; |
138 | if (Type == 1) then |
139 | Cons = gBits8() ~= 0; |
140 | elseif (Type == 2) then |
141 | Cons = gFloat(); |
142 | elseif (Type == 3) then |
143 | Cons = gString(); |
144 | end |
145 | Consts[Idx] = Cons; |
146 | end |
147 | Chunk[3] = gBits8(); |
148 | for Idx = 1, gBits32() do |
149 | local Descriptor = gBits8(); |
150 | if (gBit(Descriptor, 1, 1) == 0) then |
151 | local Type = gBit(Descriptor, 2, 3); |
152 | local Mask = gBit(Descriptor, 4, 6); |
153 | local Inst = {gBits16(),gBits16(),nil,nil}; |
154 | if (Type == 0) then |
155 | Inst[3] = gBits16(); |
156 | Inst[4] = gBits16(); |
157 | elseif (Type == 1) then |
158 | Inst[3] = gBits32(); |
159 | elseif (Type == 2) then |
160 | Inst[3] = gBits32() - (2 ^ 16); |
161 | elseif (Type == 3) then |
162 | Inst[3] = gBits32() - (2 ^ 16); |
163 | Inst[4] = gBits16(); |
164 | end |
165 | if (gBit(Mask, 1, 1) == 1) then |
166 | Inst[2] = Consts[Inst[2]]; |
167 | end |
168 | if (gBit(Mask, 2, 2) == 1) then |
169 | Inst[3] = Consts[Inst[3]]; |
170 | end |
171 | if (gBit(Mask, 3, 3) == 1) then |
172 | Inst[4] = Consts[Inst[4]]; |
173 | end |
174 | Instrs[Idx] = Inst; |
175 | end |
176 | end |
177 | for Idx = 1, gBits32() do |
178 | Functions[Idx - 1] = Deserialize(); |
179 | end |
180 | return Chunk; |
181 | end |
182 | local function Wrap(Chunk, Upvalues, Env) |
183 | local Instr = Chunk[1]; |
184 | local Proto = Chunk[2]; |
185 | local Params = Chunk[3]; |
186 | return function(...) |
187 | local Instr = Instr; |
188 | local Proto = Proto; |
189 | local Params = Params; |
190 | local _R = _R; |
191 | local VIP = 1; |
192 | local Top = -1; |
193 | local Vararg = {}; |
194 | local Args = {...}; |
195 | local PCount = Select("#", ...) - 1; |
196 | local Lupvals = {}; |
197 | local Stk = {}; |
198 | for Idx = 0, PCount do |
199 | if (Idx >= Params) then |
200 | Vararg[Idx - Params] = Args[Idx + 1]; |
201 | else |
202 | Stk[Idx] = Args[Idx + 1]; |
203 | end |
204 | end |
205 | local Varargsz = (PCount - Params) + 1; |
206 | local Inst; |
207 | local Enum; |
208 | while true do |
209 | Inst = Instr[VIP]; |
210 | Enum = Inst[1]; |
211 | if (Enum <= 20) then |
212 | if (Enum <= 9) then |
213 | if (Enum <= 4) then |
214 | if (Enum <= 1) then |
215 | if (Enum > 0) then |
216 | Stk[Inst[2]] = Stk[Inst[3]]; |
217 | else |
218 | local NewProto = Proto[Inst[3]]; |
219 | local NewUvals; |
220 | local Indexes = {}; |
221 | NewUvals = Setmetatable({}, {__index=function(_, Key) |
222 | local Val = Indexes[Key]; |
223 | return Val[1][Val[2]]; |
224 | end,__newindex=function(_, Key, Value) |
225 | local Val = Indexes[Key]; |
226 | Val[1][Val[2]] = Value; |
227 | end}); |
228 | for Idx = 1, Inst[4] do |
229 | VIP = VIP + 1; |
230 | local Mvm = Instr[VIP]; |
231 | if (Mvm[1] == 12) then |
232 | Indexes[Idx - 1] = {Stk,Mvm[3]}; |
233 | else |
234 | Indexes[Idx - 1] = {Upvalues,Mvm[3]}; |
235 | end |
236 | Lupvals[#Lupvals + 1] = Indexes; |
237 | end |
238 | Stk[Inst[2]] = Wrap(NewProto, NewUvals, Env); |
239 | end |
240 | elseif (Enum <= 2) then |
241 | local A = Inst[2]; |
242 | Stk[A] = Stk[A](Stk[A + 1]); |
243 | elseif (Enum == 3) then |
244 | Stk[Inst[2]] = Env[Inst[3]]; |
245 | else |
246 | Stk[Inst[2]] = Upvalues[Inst[3]]; |
247 | end |
248 | elseif (Enum <= 6) then |
249 | if (Enum > 5) then |
250 | Stk[Inst[2]][Inst[3]] = Stk[Inst[4]]; |
251 | else |
252 | Stk[Inst[2]] = Stk[Inst[3]] + Stk[Inst[4]]; |
253 | end |
254 | elseif (Enum <= 7) then |
255 | local A = Inst[2]; |
256 | Stk[A](Stk[A + 1]); |
257 | elseif (Enum > 8) then |
258 | Stk[Inst[2]] = Stk[Inst[3]] * Inst[4]; |
259 | else |
260 | local A = Inst[2]; |
261 | local B = Stk[Inst[3]]; |
262 | Stk[A + 1] = B; |
263 | Stk[A] = B[Inst[4]]; |
264 | end |
265 | elseif (Enum <= 14) then |
266 | if (Enum <= 11) then |
267 | if (Enum > 10) then |
268 | Stk[Inst[2]](); |
269 | else |
270 | Stk[Inst[2]] = Stk[Inst[3]][Inst[4]]; |
271 | end |
272 | elseif (Enum <= 12) then |
273 | Stk[Inst[2]] = Stk[Inst[3]]; |
274 | elseif (Enum > 13) then |
275 | Stk[Inst[2]] = Inst[3]; |
276 | else |
277 | local A = Inst[2]; |
278 | Stk[A] = Stk[A](Unpack(Stk, A + 1, Inst[3])); |
279 | end |
280 | elseif (Enum <= 17) then |
281 | if (Enum <= 15) then |
282 | Stk[Inst[2]] = Upvalues[Inst[3]]; |
283 | elseif (Enum > 16) then |
284 | Stk[Inst[2]] = Stk[Inst[3]][Inst[4]]; |
285 | else |
286 | local NewProto = Proto[Inst[3]]; |
287 | local NewUvals; |
288 | local Indexes = {}; |
289 | NewUvals = Setmetatable({}, {__index=function(_, Key) |
290 | local Val = Indexes[Key]; |
291 | return Val[1][Val[2]]; |
292 | end,__newindex=function(_, Key, Value) |
293 | local Val = Indexes[Key]; |
294 | Val[1][Val[2]] = Value; |
295 | end}); |
296 | for Idx = 1, Inst[4] do |
297 | VIP = VIP + 1; |
298 | local Mvm = Instr[VIP]; |
299 | if (Mvm[1] == 12) then |
300 | Indexes[Idx - 1] = {Stk,Mvm[3]}; |
301 | else |
302 | Indexes[Idx - 1] = {Upvalues,Mvm[3]}; |
303 | end |
304 | Lupvals[#Lupvals + 1] = Indexes; |
305 | end |
306 | Stk[Inst[2]] = Wrap(NewProto, NewUvals, Env); |
307 | end |
308 | elseif (Enum <= 18) then |
309 | Stk[Inst[2]] = Env[Inst[3]]; |
310 | elseif (Enum > 19) then |
311 | Stk[Inst[2]][Inst[3]] = Inst[4]; |
312 | else |
313 | Stk[Inst[2]] = Stk[Inst[3]] * Inst[4]; |
314 | end |
315 | elseif (Enum <= 30) then |
316 | if (Enum <= 25) then |
317 | if (Enum <= 22) then |
318 | if (Enum == 21) then |
319 | local A = Inst[2]; |
320 | Stk[A](Stk[A + 1]); |
321 | else |
322 | local A = Inst[2]; |
323 | Stk[A] = Stk[A](Unpack(Stk, A + 1, Inst[3])); |
324 | end |
325 | elseif (Enum <= 23) then |
326 | local A = Inst[2]; |
327 | local Step = Stk[A + 2]; |
328 | local Index = Stk[A] + Step; |
329 | Stk[A] = Index; |
330 | if (Step > 0) then |
331 | if (Index <= Stk[A + 1]) then |
332 | VIP = Inst[3]; |
333 | Stk[A + 3] = Index; |
334 | end |
335 | elseif (Index >= Stk[A + 1]) then |
336 | VIP = Inst[3]; |
337 | Stk[A + 3] = Index; |
338 | end |
339 | elseif (Enum > 24) then |
340 | Stk[Inst[2]] = Wrap(Proto[Inst[3]], nil, Env); |
341 | else |
342 | do |
343 | return; |
344 | end |
345 | end |
346 | elseif (Enum <= 27) then |
347 | if (Enum > 26) then |
348 | local A = Inst[2]; |
349 | local Index = Stk[A]; |
350 | local Step = Stk[A + 2]; |
351 | if (Step > 0) then |
352 | if (Index > Stk[A + 1]) then |
353 | VIP = Inst[3]; |
354 | else |
355 | Stk[A + 3] = Index; |
356 | end |
357 | elseif (Index < Stk[A + 1]) then |
358 | VIP = Inst[3]; |
359 | else |
360 | Stk[A + 3] = Index; |
361 | end |
362 | else |
363 | local A = Inst[2]; |
364 | local Index = Stk[A]; |
365 | local Step = Stk[A + 2]; |
366 | if (Step > 0) then |
367 | if (Index > Stk[A + 1]) then |
368 | VIP = Inst[3]; |
369 | else |
370 | Stk[A + 3] = Index; |
371 | end |
372 | elseif (Index < Stk[A + 1]) then |
373 | VIP = Inst[3]; |
374 | else |
375 | Stk[A + 3] = Index; |
376 | end |
377 | end |
378 | elseif (Enum <= 28) then |
379 | local A = Inst[2]; |
380 | Stk[A] = Stk[A](Stk[A + 1]); |
381 | elseif (Enum > 29) then |
382 | Stk[Inst[2]] = Inst[3]; |
383 | else |
384 | Stk[Inst[2]](); |
385 | end |
386 | elseif (Enum <= 35) then |
387 | if (Enum <= 32) then |
388 | if (Enum > 31) then |
389 | local A = Inst[2]; |
390 | Stk[A](Unpack(Stk, A + 1, Inst[3])); |
391 | else |
392 | Stk[Inst[2]] = Wrap(Proto[Inst[3]], nil, Env); |
393 | end |
394 | elseif (Enum <= 33) then |
395 | Stk[Inst[2]] = Stk[Inst[3]] + Stk[Inst[4]]; |
396 | elseif (Enum > 34) then |
397 | local A = Inst[2]; |
398 | local Step = Stk[A + 2]; |
399 | local Index = Stk[A] + Step; |
400 | Stk[A] = Index; |
401 | if (Step > 0) then |
402 | if (Index <= Stk[A + 1]) then |
403 | VIP = Inst[3]; |
404 | Stk[A + 3] = Index; |
405 | end |
406 | elseif (Index >= Stk[A + 1]) then |
407 | VIP = Inst[3]; |
408 | Stk[A + 3] = Index; |
409 | end |
410 | else |
411 | Stk[Inst[2]][Inst[3]] = Inst[4]; |
412 | end |
413 | elseif (Enum <= 38) then |
414 | if (Enum <= 36) then |
415 | do |
416 | return; |
417 | end |
418 | elseif (Enum == 37) then |
419 | Stk[Inst[2]] = #Stk[Inst[3]]; |
420 | else |
421 | local A = Inst[2]; |
422 | local B = Stk[Inst[3]]; |
423 | Stk[A + 1] = B; |
424 | Stk[A] = B[Inst[4]]; |
425 | end |
426 | elseif (Enum <= 39) then |
427 | Stk[Inst[2]][Inst[3]] = Stk[Inst[4]]; |
428 | elseif (Enum > 40) then |
429 | Stk[Inst[2]] = #Stk[Inst[3]]; |
430 | else |
431 | local A = Inst[2]; |
432 | Stk[A](Unpack(Stk, A + 1, Inst[3])); |
433 | end |
434 | VIP = VIP + 1; |
435 | end |
436 | end; |
437 | end |
438 | return Wrap(Deserialize(), {}, vmenv)(...); |
439 | end |
440 | return VMCall("LOL!5O00023O00021F8O00243O00013O00013O002B3O0003083O00496E7374616E63652O033O006E657703093O005363722O656E47756903043O004E616D6503123O00437573746F6D4E6F74696669636174696F6E03063O00506172656E7403043O0067616D6503073O00436F726547756903053O004672616D6503103O004261636B67726F756E64436F6C6F723303063O00436F6C6F723303073O0066726F6D524742028O0003043O0053697A6503053O005544696D32026O00E03F026O00494003083O00506F736974696F6E029A5O99B93F030B3O00416E63686F72506F696E7403073O00566563746F723203083O005549436F726E6572030C3O00436F726E657252616469757303043O005544696D026O00204003093O00546578744C6162656C03043O0054657874034O00030A3O0054657874436F6C6F723303043O00466F6E7403043O00456E756D03053O00536369466903083O005465787453697A65026O00324003163O004261636B67726F756E645472616E73706172656E6379026O00F03F030B3O00546578745772612O7065642O0103093O00636F726F7574696E6503043O007772617003043O0077616974027B14AE47E17AA43F03073O0044657374726F7905623O001203000500013O00201100050005000200120E000600034O001C000500020002003014000500040005001203000600073O002011000600060008001027000500060006001203000600013O00201100060006000200120E000700094O001C0006000200020010270006000600050012030007000B3O00201100070007000C00120E0008000D3O00120E0009000D3O00120E000A000D4O00160007000A00020010270006000A00070012030007000F3O00201100070007000200120E000800103O00120E0009000D3O00120E000A000D3O00120E000B00114O00160007000B00020010270006000E00070012030007000F3O00201100070007000200120E000800103O00120E0009000D3O00120E000A00133O00120E000B000D4O00160007000B0002001027000600120007001203000700153O00201100070007000200120E000800103O00120E0009000D4O0016000700090002001027000600140007001203000700013O00201100070007000200120E000800164O0001000900064O0016000700090002001203000800183O00201100080008000200120E0009000D3O00120E000A00194O00160008000A0002001027000700170008001203000800013O00201100080008000200120E0009001A4O001C0008000200020010270008000600060030140008001B001C0012030009000B3O00201100090009000C2O0001000A00024O0001000B00034O0001000C00044O00160009000C00020010270008001D00090012030009001F3O00201100090009001E0020110009000900200010270008001E00090030140008002100220030140008002300240012030009000F3O00201100090009000200120E000A00243O00120E000B000D3O00120E000C00243O00120E000D000D4O00160009000D00020010270008000E000900301400080025002600021F00095O001203000A00273O002011000A000A0028000610000B0001000100032O000C3O00094O000C3O00084O000C8O001C000A000200022O001D000A00010001001203000A00294O0025000B5O002009000B000B002A2O0021000B000B00012O0015000A00020001002008000A0005002B2O0015000A000200012O00243O00013O00023O00053O00026O00F03F03043O005465787403063O00737472696E672O033O0073756203043O007761697403103O00120E000300014O0025000400013O00120E000500013O00041A0003000F0001001203000700033O0020110007000700042O0001000800013O00120E000900014O0001000A00064O00160007000A00020010273O00020007001203000700054O0001000800024O00150007000200010004170003000400012O00243O00017O00013O00027B14AE47E17AA43F00064O000F8O000F000100014O000F000200023O00120E000300014O00283O000300012O00243O00017O00", GetFEnv(), ...); |