├── .gitattributes ├── crc32_unobfuscated.py ├── test_unobfuscated.py ├── bitwise_obfuscation.py ├── .gitignore ├── README.md ├── dirac_point_function.py ├── crc32_obfuscated.py ├── astobfuscate.py ├── test_obfuscated.py └── LICENSE /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /crc32_unobfuscated.py: -------------------------------------------------------------------------------- 1 | # Make an example function that checks to see 2 | # if the flag's CRC is equal to a specified value 3 | # Flag is b'example_ctf{this_is_a_flag_A9uIus}' 4 | 5 | # Uses obfuscation techniques from dirac_point_function.py 6 | # And bitwise_obfuscation.py 7 | 8 | 9 | def flag_check(buf, *, ast_no_obfuscate=None): 10 | if not buf.startswith(bytes('example_ctf{', encoding='utf-8')) and buf[-1] == '}': 11 | return False 12 | 13 | init = 0xffffffff 14 | 15 | arr = [] 16 | 17 | for entry in range(256): 18 | l = entry 19 | for i in range(8): 20 | if l & 1: 21 | l = ~(l & 0x1db710640) & ~(~l & ~0x1db710640) 22 | l = l // 2 23 | arr.append(l) 24 | 25 | for char in buf: 26 | init = (init // 256) ^ arr[(~(~(~(init & 0xff) & ~(init & 0xff))) & char) | ((~(~(init & 0xff) & ~(init & 0xff))) & ~char)] 27 | 28 | init = init ^ 0xffffffff 29 | 30 | return ((lambda a, b: (lambda f, a, b: f(f, a, b))(lambda f, a, b: f(f, a ^ b, (a & b) << 1) if b else a, a, b))((((init ^ 2706522384) + 1) & (~(init ^ 2706522384)) | 1081813890), ( 31 | ~(((init ^ 2706522384) + 1) & (~(init ^ 2706522384))) & 1065669757)) % (1 << 32)) ^ 4293732728 == 1234567 32 | -------------------------------------------------------------------------------- /test_unobfuscated.py: -------------------------------------------------------------------------------- 1 | import getpass 2 | from os import urandom 3 | 4 | name = getpass.win_getpass('What is your name?') 5 | 6 | 7 | def random_bytes(num_bytes, *, ast_no_obfuscate=None): 8 | byte_data = urandom(num_bytes) 9 | return byte_data 10 | 11 | 12 | def single_random_byte(unused_arg): 13 | return urandom(1) 14 | 15 | 16 | def add_2_nested(a, b): 17 | def x(b): 18 | return b + 2 19 | return x(a) 20 | 21 | 22 | class Data: 23 | internal = 2 24 | 25 | def add_2_instance(self, a, *, ast_no_obfuscate=None): 26 | return a + self.internal 27 | 28 | @classmethod 29 | def add_2_class(cls, a): 30 | return a + cls.internal 31 | 32 | @staticmethod 33 | def add_2_static(a): 34 | return a + 2 35 | 36 | if name: 37 | print('Hello, %s!' % name) 38 | else: 39 | print('I see how it is!') 40 | 41 | x = 57 42 | print(x, Data.add_2_class(x), Data().add_2_instance(x), Data().add_2_static(x), add_2_nested(x, None), x // 2, 0.1 + 0.2, ~2) 43 | print('Expected: 57 59 59 59 59 28 0.30000000000000004 -3\n') 44 | 45 | x += 15 46 | print(x) 47 | print('Expected: 72\n') 48 | 49 | Data.internal += 1 50 | 51 | print(x, Data.add_2_class(x), Data().add_2_instance(x), Data().add_2_static(x), add_2_nested(x, None)) 52 | print('Expected: 72 75 75 74 74\n') 53 | 54 | print(True, True, True, True, True) 55 | print('Expected: True True True True True\n') 56 | 57 | print(False, False, False, False, False) 58 | print('Expected: False False False False False\n') 59 | 60 | print('Random byte is: %r' % single_random_byte(None)) -------------------------------------------------------------------------------- /bitwise_obfuscation.py: -------------------------------------------------------------------------------- 1 | from z3 import * 2 | """ 3 | Proves the equivalence of certain operators to highly obfuscated bitwise alternatives 4 | 5 | Uses the Z3 theorem prover: 6 | 7 | https://github.com/Z3Prover/z3 8 | """ 9 | 10 | BITS = 64 11 | 12 | def prove(equality): 13 | s = Solver() 14 | s.add(Not(equality)) 15 | return s.check() == unsat 16 | 17 | 18 | x, y = BitVecs('x y', BITS) 19 | 20 | proofs = [ 21 | x + y == 2 * (x | y) - (x ^ y), 22 | x + y == (x | y) + (x & y), 23 | 24 | x - y == 2 * (x | ~y + 1) - (x ^ ~y + 1), 25 | x - y == (x | ~y + 1) + (x & ~y + 1), 26 | 27 | x | y == (x ^ y) | (x & y), 28 | x | y == ~(~(x & x) & ~(y & y)), 29 | 30 | x & y == (x | y) - (x ^ y), 31 | x & y == ~(~(x & y) & ~(x & y)), 32 | 33 | x ^ y == x - y + 2 * (~x & y), 34 | x ^ y == (x | y) & ~(x & y) 35 | x ^ y == ~(x & y) & ~(~x & ~y), 36 | x ^ y == (~x & y) | (x & ~y), 37 | 38 | ~x == ~(x & x), 39 | ~x == ~(x & (x ^ ~x)) & ~(~x & 0), 40 | ~x == x ^ (x ^ ~x), 41 | 42 | -x == ~(x & x) + 1, 43 | -x == (~(x & (x ^ ~x)) & ~(~x & 0)) + 1, 44 | -x == (x ^ (x ^ ~x)) + 1, 45 | ] 46 | 47 | assert(all([prove(proof) for proof in proofs])) 48 | 49 | print('Proved all equalities!') 50 | 51 | # Addition through bitwise and recursion 52 | # XOR finds places that add to 1, AND and bitshift is the carry. 53 | # Y combinator is used to recurively move the carry until the addition is done. 54 | 55 | add = lambda a, b: (lambda f, a, b: f(f, a, b))(lambda f, a, b: f(f, a ^ b, (a & b) << 1) if b else a, a, b) 56 | 57 | for i in range(129): 58 | for j in range(129): 59 | assert add(i, j) == i + j 60 | 61 | print('Proved obfuscated recursive addition function!') 62 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Byte-compiled / optimized / DLL files 2 | __pycache__/ 3 | *.py[cod] 4 | *$py.class 5 | 6 | # C extensions 7 | *.so 8 | 9 | # Distribution / packaging 10 | .Python 11 | build/ 12 | develop-eggs/ 13 | dist/ 14 | downloads/ 15 | eggs/ 16 | .eggs/ 17 | lib/ 18 | lib64/ 19 | parts/ 20 | sdist/ 21 | var/ 22 | wheels/ 23 | *.egg-info/ 24 | .installed.cfg 25 | *.egg 26 | MANIFEST 27 | 28 | # PyInstaller 29 | # Usually these files are written by a python script from a template 30 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 31 | *.manifest 32 | *.spec 33 | 34 | # Installer logs 35 | pip-log.txt 36 | pip-delete-this-directory.txt 37 | 38 | # Unit test / coverage reports 39 | htmlcov/ 40 | .tox/ 41 | .nox/ 42 | .coverage 43 | .coverage.* 44 | .cache 45 | nosetests.xml 46 | coverage.xml 47 | *.cover 48 | .hypothesis/ 49 | .pytest_cache/ 50 | 51 | # Translations 52 | *.mo 53 | *.pot 54 | 55 | # Django stuff: 56 | *.log 57 | local_settings.py 58 | db.sqlite3 59 | 60 | # Flask stuff: 61 | instance/ 62 | .webassets-cache 63 | 64 | # Scrapy stuff: 65 | .scrapy 66 | 67 | # Sphinx documentation 68 | docs/_build/ 69 | 70 | # PyBuilder 71 | target/ 72 | 73 | # Jupyter Notebook 74 | .ipynb_checkpoints 75 | 76 | # IPython 77 | profile_default/ 78 | ipython_config.py 79 | 80 | # pyenv 81 | .python-version 82 | 83 | # celery beat schedule file 84 | celerybeat-schedule 85 | 86 | # SageMath parsed files 87 | *.sage.py 88 | 89 | # Environments 90 | .env 91 | .venv 92 | env/ 93 | venv/ 94 | ENV/ 95 | env.bak/ 96 | venv.bak/ 97 | 98 | # Spyder project settings 99 | .spyderproject 100 | .spyproject 101 | 102 | # Rope project settings 103 | .ropeproject 104 | 105 | # mkdocs documentation 106 | /site 107 | 108 | # mypy 109 | .mypy_cache/ 110 | .dmypy.json 111 | dmypy.json 112 | 113 | # Pyre type checker 114 | .pyre/ 115 | .idea/ 116 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # ASTObfuscate 2 | 3 | ASTObfuscate is a little project designed to parse Python syntax, and turn that Python into an obfuscated version for compilation into `.pyc` file. 4 | 5 | ASTObfuscate is not meant for pure obfuscation of the source code, as it is relatively easy to make the source code much more readable by folding in constants 6 | 7 | ### Use Cases 8 | ASTObfuscate was originally based on [Jurrian Bremer's AST obfuscator he made for a CTF event](http://jbremer.org/python-source-obfuscation-using-asts/). 9 | ASTObfuscate may not hold up to expert eyes, but combining it with compilation into a `.pyc` file will probably make for a reasonably difficult CTF, but manual obfuscation 10 | of the source code is recommended before running it through ASTObfuscate. 11 | 12 | See the crc32 files for an example of simple CTF flag verifier obfuscated with 5 passes of ASTObfuscate 13 | 14 | ### Examples 15 | ```python 16 | print('Hello, World!') 17 | ``` 18 | becomes 19 | ```python 20 | OO11lOO01O00lllOlllOl = (lambda l00110100O00lO11111lO, 21 | lO10111llOlO1011100ll: l00110100O00lO11111lO % lO10111llOlO1011100ll) 22 | O00011OOO10OlOOl01O11 = (lambda Ol01lOlOO0100OlOlO0O0, 23 | O0lO101lO0Ol1O1lO0lOl: Ol01lOlOO0100OlOlO0O0 ^ O0lO101lO0Ol1O1lO0lOl) 24 | print(''.join(filter(lambda llO1lOOll111O0100OllO: ord( 25 | llO1lOOll111O0100OllO) % O00011OOO10OlOOl01O11(2 ^ 4, 0 * 3 + 0) != 0 * 26 | 5 + 0, '*ZZ\x12\x0cx\x00\x0660\x12xZ\x18\x0c')).join(chr( 27 | O00011OOO10OlOOl01O11(ll0O1O110lOO0OlOl10OO, OO11OOl1lO0O0011OOlll)) for 28 | OO11OOl1lO0O0011OOlll, ll0O1O110lOO0OlOl10OO in zip( 29 | b'\\rUc\xc0KgW\xf8\xfc?\x12\x0b', b'}\x169\x11\xaf\x1cG{\x97\x90SwC'))[ 30 | ::-1 * 6 + 5 ^ 0 * 6 + 0]) 31 | ``` 32 | 33 | ### Usage 34 | ```$ astobfuscate.py ``` 35 | 36 | Run ASTObfuscate on the source code `passes` times. Note that the code will become exponentially slower and larger as the number of passes go up. 37 | 38 | ```$ astobfuscate.py ``` 39 | 40 | Run ASTObfuscate on the source code once. 41 | 42 | In Python source: 43 | 44 | ```python 45 | def function_to_remain(arg1, arg2, arg3, *remaining, ast_no_obfuscate=None): 46 | pass 47 | ``` 48 | 49 | Tell ASTObfuscate that a function's name and arguments should remain the same and not be changed. All other functions will be renamed and have their arguments obfuscated 50 | 51 | ### Possible improvements: 52 | * Add a function to turn the entire program into a single line of code, likely using csvoss's [onelinerizer](https://github.com/csvoss/onelinerizer). This approach will likely fail 53 | if the program needs to have functions or classes exported. 54 | 55 | * Add more ways for integers, strings, and booleans to be obfuscated. This would add more variation to the generated code. 56 | 57 | * Class attribute and method obfuscation. 58 | 59 | * Folding of single return statement functions into lambdas 60 | 61 | * Lambda namespaces 62 | 63 | ### Thanks for reading! -------------------------------------------------------------------------------- /dirac_point_function.py: -------------------------------------------------------------------------------- 1 | from arybo.lib import MBA, boolean_expr_solve 2 | import random 3 | """ 4 | Implements a generator for a dirac delta function, which is a function which is one value across it's entire domain 5 | except for one input 6 | 7 | Can be used to have an obfuscated equality check or the like 8 | 9 | Uses the Arybo Mixed Boolean Arithmetic symbolics library 10 | """ 11 | 12 | 13 | 14 | # Initialize our values: 15 | # Bitlength 16 | # The "zero" of the dirac function, or rather where it is different 17 | # The desired output at the zero 18 | 19 | bitlength = input('What is the desired bitlength? Press enter to default to 64.\n>>>') 20 | 21 | bitlength = int(bitlength) if bitlength else 64 22 | 23 | desired_zero = input('What is the desired solution of the Dirac function?\n' 24 | 'E.G. 0xdeadbeef, 12345, etc.\n' 25 | 'Press enter to default to random value\n>>>') 26 | 27 | desired_zero = eval(desired_zero) if desired_zero else random.getrandbits(bitlength) 28 | 29 | desired_output = input('What is the desired output at the dirac value?\n' 30 | 'E.G. 0xdeadbeef, 12345, etc.\n' 31 | 'Press enter to default to random value\n>>>') 32 | 33 | desired_output = eval(desired_output) if desired_output else random.getrandbits(bitlength) 34 | 35 | 36 | 37 | # They have to fit within our bitlength 38 | assert type(desired_zero) == int and desired_zero.bit_length() <= bitlength 39 | assert type(desired_output) == int and desired_output.bit_length() <= bitlength 40 | 41 | # The zero before XORing with e is always 0x7ffff... 42 | basic_zero = ((1 << bitlength - 1) - 1) 43 | 44 | # Basic bit of obfuscation, this doesn't change anything 45 | a = random.getrandbits(bitlength - 1) 46 | b = a ^ basic_zero 47 | 48 | # This gets XORed to produce the desired output 49 | d = desired_output ^ ((1 << bitlength) - 1) 50 | 51 | # This gets XORed to produce the desired input 52 | e = desired_zero ^ basic_zero 53 | 54 | 55 | # Our function 56 | def f(X): 57 | T = (X + 1) & (~X) 58 | return ((T | a) + (~(T) & b)) ^ d 59 | 60 | # Solve the function with Arybo to ensure it's a Dirac delta 61 | m = MBA(bitlength) 62 | c = m.var('x') 63 | 64 | # Solve where the output highest bit is equal to the highest bit in the desired output 65 | # Everything else will always be equal 66 | sols = boolean_expr_solve(f(c)[bitlength - 1], c, (desired_output & ~(basic_zero)) >> bitlength) 67 | zero = sols[0].get_int_be() 68 | 69 | # We should only have one solution, and it should be our 0x7ffff... 70 | assert len(sols) == 1 71 | assert zero == basic_zero 72 | 73 | 74 | # Build the same function but with the XORing with e to change the actual zero 75 | def f(X): 76 | X = X ^ e 77 | T = (X + 1) & (~X) 78 | return ((T | a) + (~(T) & b)) ^ d 79 | 80 | zero = zero ^ e 81 | 82 | # Evaluate our function to show to the user it's working 83 | print('Dirac Value: %s' % hex(zero)) 84 | print('Function at Dirac: %s' % hex(f(zero))) 85 | print('Function at Dirac + 1: %s' % hex(f((zero + 1) % (2 ** bitlength - 1)))) 86 | print('Function at Dirac + 2: %s' % hex(f((zero + 2) % (2 ** bitlength - 1)))) 87 | 88 | 89 | # Print out our dirac function with everything inlined 90 | print('Dirac Function:\n((((x ^ %s) + 1) & (~(x ^ %s)) | %s) + (~(((x ^ %s) + 1) & (~(x ^ %s))) & %s)) ^ %s' % (e, e, a, e, e, b, d)) -------------------------------------------------------------------------------- /crc32_obfuscated.py: -------------------------------------------------------------------------------- 1 | O1lO11l10O00OlO01OOOl = lambda llOlOOOll00O0l0lOl1Ol: ~llOlOOOll00O0l0lOl1Ol 2 | l11l1lOOll01Ol111101O = lambda O10OOl1OOO1OO000O1l01: -O10OOl1OOO1OO000O1l01 3 | l0lO0O11OO01O1ll000Ol = lambda OOOll0l0O1O011lOl0l11: not OOOll0l0O1O011lOl0l11 4 | ll0lO11OO1011O01ll00O = (lambda O000l0O111l1101OO00Ol, 5 | OOll1ll1Oll100000OO0O: O000l0O111l1101OO00Ol and OOll1ll1Oll100000OO0O) 6 | l1O00ll1O1O1lOl1l1O00 = (lambda l1011lO01OOO0O0000Oll, 7 | OO0O100O0O1l0l0OO11ll: l1011lO01OOO0O0000Oll - OO0O100O0O1l0l0OO11ll) 8 | OOllOO11Ol00ll0O0l10O = (lambda lll0l1l100l1Ol0O1O1lO, 9 | OOO0lO010l0l0ll010l0l: lll0l1l100l1Ol0O1O1lO * OOO0lO010l0l0ll010l0l) 10 | Ol1O11lOO0O001OOO111l = (lambda O0l1l110Ol00OO0001lOO, 11 | OO00011O0O0l1O0lO1111: O0l1l110Ol00OO0001lOO % OO00011O0O0l1O0lO1111) 12 | lO11l0O01l001O11l0101 = (lambda lO11l1l00ll00O11l000O, 13 | ll11llOll0l010O11O1l0: lO11l1l00ll00O11l000O + ll11llOll0l010O11O1l0) 14 | O1lOO0ll10100OO0101lO = (lambda O1OlO111O0l101010lll1, 15 | O1ll001O000l110lO0OOl: O1OlO111O0l101010lll1 << O1ll001O000l110lO0OOl) 16 | l0O1ll0OO1010OOlll11l = (lambda O1O00O000ll1l0OlO0l0l, 17 | O0O110ll01O10l1l1l1O0: O1O00O000ll1l0OlO0l0l ^ O0O110ll01O10l1l1l1O0) 18 | l1OOOO00110O1O1001111 = (lambda l1ll0OO0O1101l0l11010, 19 | lll1O00OOO10OOlOO100O: l1ll0OO0O1101l0l11010 | lll1O00OOO10OOlOO100O) 20 | Ol01llllO1ll11OO11010 = (lambda ll0OlOOl111OlOl01011l, 21 | OOOOOl11O0l01lO011O01: ll0OlOOl111OlOl01011l // OOOOOl11O0l01lO011O01) 22 | O10lOOllO10lOll0010OO = (lambda ll1l1OlO10Oll101O100O, 23 | ll0O0l1O0ll100llO111l: ll1l1OlO10Oll101O100O & ll0O0l1O0ll100llO111l) 24 | 25 | 26 | def flag_check(buf): 27 | if l0lO0O11OO01O1ll000Ol(getattr(buf, ''.join(filter(lambda 28 | OlOlOll00O101000O000O: ord(OlOlOll00O101000O000O) % 3 != 0, 29 | 'f\x0fQfH?f\t\x18lB\x1e?\x00*')).join(chr(Ol0l00l1O110O0Ol010l0 ^ 30 | O10OOOO0ll01lO1Olll0O) for O10OOOO0ll01lO1Olll0O, 31 | Ol0l00l1O110O0Ol010l0 in zip(b'\xc9fA\x97\xdf\x9e\xf6\x13\xb5\x82', 32 | b'\xba\x12 \xe5\xab\xed\x81z\xc1\xea')))(bytes(lO11l0O01l001O11l0101( 33 | ''.join(filter(lambda O01101OOll0l0l1OOl1O1: ord(O01101OOll0l0l1OOl1O1 34 | ) % 5 != 0, '}\n_nUsZ\x1e-\x05PZ\x00U_')).join(chr( 35 | l01000l00Ol11001O1OOl ^ l1OlO1O1O001110l1OO0l) for 36 | l1OlO1O1O001110l1OO0l, l01000l00Ol11001O1OOl in zip(b'f\xe3\xdc\xe6dm', 37 | b'\x1d\x85\xa8\x85;\x08')), ''.join(filter(lambda 38 | lOl11OlO1110l0001111l: ord(lOl11OlO1110l0001111l) % 5 != 0, 39 | 'F7x-P\x00d\x14UP-i\x0f-\x00')).join(chr(l11O1l00l010OOlOlOlO0 ^ 40 | l10O00Ol101101O0O1lO1) for l10O00Ol101101O0O1lO1, 41 | l11O1l00l010OOlOlOlO0 in zip(b'\xb6\xa3V\xb0\xdc4', 42 | b'\xda\xd3;\xd1\xa4Q')))[::lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O 43 | (-1 ^ 0, 1 * 3 + 2), 4)], encoding=(''.join(chr(l11ll1lO11110000O101O ^ 44 | O0Ol0l11ll11llll0l00l) for O0Ol0l11ll11llll0l00l, 45 | l11ll1lO11110000O101O in zip(b']\xfb', b'e\xd6')) + 'ftu'[::-1][::-1 * 46 | 12 + 11])[::-1 ^ 0]))) and buf[l11l1lOOll01Ol111101O( 47 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(0, ((0 * 3 + 0) * (0 * 14 + 48 | 2) + 0) * (0 * 15 + 14) + (0 * 7 + 6)), 0 * 13 + (0 * 12 + 1) ^ 0)) 49 | ] == chr(3 - (7 * 15 + 9 ^ 12) + (2 ^ 0) * ((O1lO11l10O00OlO01OOOl(3) | 50 | 10 * 11 + 4 ^ (10 ^ 6)) - (O1lO11l10O00OlO01OOOl(3) ^ (10 * 11 + 4 ^ ( 51 | 10 ^ 6))))): 52 | return (O1lO11l10O00OlO01OOOl(17 * 9 + 1 & (5 ^ 26)) & ~ 53 | O10lOOllO10lOll0010OO(O1lO11l10O00OlO01OOOl(154), ~(10 * 3 + 1)) 54 | ) % l0O1ll0OO1010OOlll11l(1 * 14 + 6 ^ 1 * 6 + 3, 2 ^ 1 * 10 + 5) == 0 55 | l111OOl1OOlOlllO0lO10 = lO11l0O01l001O11l0101((67108863 * (2 * 8 + 0) + 15 56 | ) * lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(0 ^ 1, 3), 57 | lO11l0O01l001O11l0101(0 * (12 ^ 6), 1)), lO11l0O01l001O11l0101( 58 | l1O00ll1O1O1lOl1l1O00(0 * 2 + 0, (1 ^ 0) * 3 + 0), 59 | OOllOO11Ol00ll0O0l10O(2, ~(0 * 13 + 0) & 1 * (0 ^ 3) + 0))) 60 | O10l10100llOlO00OlO0O = [] 61 | for l00000l10lO1000l11100 in range(lO11l0O01l001O11l0101( 62 | OOllOO11Ol00ll0O0l10O(1 * 12 + 4, 26 ^ 10), 0)): 63 | OO0111O1ll0lOOO11l0ll = l00000l10lO1000l11100 64 | for l110l11lOO1l10100OO0O in range((0 * 15 + 0) * 13 + 8): 65 | if l1OOOO00110O1O1001111(OO0111O1ll0lOOO11l0ll, lO11l0O01l001O11l0101(0 * 66 | 5 + 0 - (0 * 7 + 0 ^ 0 * 9 + 1), OOllOO11Ol00ll0O0l10O(0 * 7 + 2, 67 | O10lOOllO10lOll0010OO(~(0 * 15 + 0), 0 ^ 0 * 13 + 1)))) - ( 68 | OO0111O1ll0lOOO11l0ll ^ (0 * 7 + 0) * (10 ^ 1) + (0 * 9 + 1)): 69 | OO0111O1ll0lOOO11l0ll = O10lOOllO10lOll0010OO(O1lO11l10O00OlO01OOOl( 70 | O10lOOllO10lOll0010OO(OO0111O1ll0lOOO11l0ll, l0O1ll0OO1010OOlll11l( 71 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(lO11l0O01l001O11l0101(( 72 | 37763906 ^ 32962418) * (1 ^ 4), 3), 4), l0O1ll0OO1010OOlll11l(2, 0 ^ 73 | 1)), l0O1ll0OO1010OOlll11l(1353243622, 2514445517 * 3 + 2)))), ~ 74 | O10lOOllO10lOll0010OO(O1lO11l10O00OlO01OOOl(OO0111O1ll0lOOO11l0ll), 75 | O1lO11l10O00OlO01OOOl(lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O( 76 | 886287196, lO11l0O01l001O11l0101((0 * 16 + 1) * 5, 1 ^ 5)), 0 ^ (0 * 77 | 15 + 0) * (9 ^ 5) + (6 ^ 2))))) 78 | OO0111O1ll0lOOO11l0ll = Ol01llllO1ll11OO11010(OO0111O1ll0lOOO11l0ll, 79 | l0O1ll0OO1010OOlll11l(0 * 14 + 0, 0 ^ (0 ^ 2))) 80 | getattr(O10l10100llOlO00OlO0O, ''.join(chr(O110O1ll011l0111O1OOO ^ 81 | O00lO1lO0OOlO001OOO01) for O00lO1lO0OOlO001OOO01, 82 | O110O1ll011l0111O1OOO in zip(b'V\xe8\xac\x13\x80\xea', 83 | b'7\x98\xdcv\xee\x8e'))[::-1][::-1])(OO0111O1ll0lOOO11l0ll) 84 | for l01OOO01OOllOl1l01O11 in buf: 85 | l111OOl1OOlOlllO0lO10 = Ol01llllO1ll11OO11010(l111OOl1OOlOlllO0lO10, 86 | lO11l0O01l001O11l0101(l0O1ll0OO1010OOlll11l(0 * 15 + 9, 11 ^ 30) * ( 87 | OOllOO11Ol00ll0O0l10O(0 * 6 + 1 ^ 0, (1 ^ 0) * (6 ^ 3) + (1 ^ 0)) + ( 88 | 0 ^ 3)), 2 * 2 + 0 ^ 0 * 10 + 0)) ^ O10l10100llOlO00OlO0O[ 89 | l1OOOO00110O1O1001111(l1OOOO00110O1O1001111(O1lO11l10O00OlO01OOOl( 90 | O1lO11l10O00OlO01OOOl(O1lO11l10O00OlO01OOOl(~(~(l111OOl1OOlOlllO0lO10 & 91 | lO11l0O01l001O11l0101((57 ^ 6) * (3 ^ 7), 2 ^ 1)) and ~( 92 | l111OOl1OOlOlllO0lO10 & lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O( 93 | 63, 4), 1 * 3 + 0)))) & O1lO11l10O00OlO01OOOl((l111OOl1OOlOlllO0lO10 | 94 | OOllOO11Ol00ll0O0l10O(17 ^ 12 ^ 0 * 16 + 10 ^ (3 ^ 7) * (0 ^ 2) + (0 * 95 | 15 + 0), OOllOO11Ol00ll0O0l10O(1, 0 * 6 + 3) + (0 * 8 + 2) - 13 + 2 * 96 | (~(OOllOO11Ol00ll0O0l10O(1, 0 * 6 + 3) + (0 * 8 + 2)) & 13)) + 97 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(0 * (13 ^ 4) + (1 ^ 2), 0 * 98 | 6 + 1 ^ (1 ^ 2)), (0 * 12 + 0) * (3 ^ 0) + (1 ^ 0))) - ( 99 | l111OOl1OOlOlllO0lO10 ^ lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O( 100 | l0O1ll0OO1010OOlll11l(l0O1ll0OO1010OOlll11l(6 ^ 10, 27), 1 * 7 + 1), 101 | ~(OOllOO11Ol00ll0O0l10O(0, 11 ^ 0) + 5 & (0 ^ 13)) & ~(~( 102 | OOllOO11Ol00ll0O0l10O(0, 11 ^ 0) + 5) & ~(0 ^ 13))), 3 * 2 + 1))))), 103 | l01OOO01OOllOl1l01O11) - (O1lO11l10O00OlO01OOOl(O1lO11l10O00OlO01OOOl 104 | (O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO(l111OOl1OOlOlllO0lO10, 105 | 51 * 5 + 0)) & O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO( 106 | l111OOl1OOlOlllO0lO10, OOllOO11Ol00ll0O0l10O(31, 107 | l0O1ll0OO1010OOlll11l(3, 1) * (5 ^ 0 * 10 + 1) + 0) + 108 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(0, 15), 109 | lO11l0O01l001O11l0101(1 * 7, 0)))))) ^ l01OOO01OOllOl1l01O11), 110 | l1O00ll1O1O1lOl1l1O00(~O10lOOllO10lOll0010OO(~(l111OOl1OOlOlllO0lO10 & 111 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(l0O1ll0OO1010OOlll11l(0, 112 | 18 ^ 0), OOllOO11Ol00ll0O0l10O(0, 13) + (0 * 15 + 5) ^ 0 * (2 * 6 + 2 113 | ) + (11 ^ 0)), 1 * 3 + 0 ^ lO11l0O01l001O11l0101(0 * (2 ^ 7), 0 * 10 + 114 | 0))), O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO( 115 | l111OOl1OOlOlllO0lO10, l0O1ll0OO1010OOlll11l(lO11l0O01l001O11l0101((4 ^ 116 | 15) * (0 ^ 14), 8), lO11l0O01l001O11l0101((2 ^ 15) * ( 117 | OOllOO11Ol00ll0O0l10O(1, 0 * 14 + 4) + (1 ^ 2)), 0 * (6 ^ 10) + (0 * 118 | 13 + 2)))))) | O1lO11l10O00OlO01OOOl(l01OOO01OOllOl1l01O11), 119 | l0O1ll0OO1010OOlll11l(O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO( 120 | O1lO11l10O00OlO01OOOl(l111OOl1OOlOlllO0lO10 & lO11l0O01l001O11l0101( 121 | OOllOO11Ol00ll0O0l10O(l0O1ll0OO1010OOlll11l(0 ^ 6 ^ (14 ^ 16), 122 | lO11l0O01l001O11l0101((3 ^ 1) * 5, 0 * 8 + 0)), ~2 & 1 * 7 + 5 | 2 & 123 | ~(1 * 7 + 5)), (0 * 7 + 0) * (4 ^ 8) + (2 ^ 1))), ~ 124 | O10lOOllO10lOll0010OO(l111OOl1OOlOlllO0lO10, l0O1ll0OO1010OOlll11l( 125 | l0O1ll0OO1010OOlll11l(19 * 12 + 0, 5 * 13 + 5), 93)))), 126 | O1lO11l10O00OlO01OOOl(l01OOO01OOllOl1l01O11))))] 127 | l111OOl1OOlOlllO0lO10 = O1lO11l10O00OlO01OOOl(l111OOl1OOlOlllO0lO10 & 128 | lO11l0O01l001O11l0101((451360121 ^ 156634730) * (((1 ^ 0) * 5 + (0 ^ 1 129 | )) * (0 ^ 0 * 5 + 2) + (0 * 7 + (0 * 10 + 1))), 8) 130 | ) & O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO(O1lO11l10O00OlO01OOOl( 131 | l111OOl1OOlOlllO0lO10), O1lO11l10O00OlO01OOOl(lO11l0O01l001O11l0101( 132 | OOllOO11Ol00ll0O0l10O(l0O1ll0OO1010OOlll11l(~(6017518 * 14 + 9) & 133 | 1776320 * 7 + 2 | 6017518 * 14 + 9 & ~(1776320 * 7 + 2), 369752924), 0 * 134 | 14 + 13), lO11l0O01l001O11l0101((0 * (0 * 14 + 9) + 0) * (1 * (3 * 3 + 135 | 0) + (0 * 10 + 7)), (0 * 6 + 0) * (0 ^ 11) + 8))))) 136 | return l0O1ll0OO1010OOlll11l(Ol1O11lOO0O001OOO111l((lambda 137 | Ol11l1ll0l1lO11001O10, O1OOll11l0l1OO011OO11: (lambda 138 | O0ll11010l0OOOl0011l0, O110OlO0O1010llll0O11, l1101O0Ol00110llOO0l0: 139 | O0ll11010l0OOOl0011l0(O0ll11010l0OOOl0011l0, O110OlO0O1010llll0O11, 140 | l1101O0Ol00110llOO0l0))(lambda O00Ol0ll100Ol0OO10Ol1, 141 | O111l00lOOOllOOOllOlO, OOOl10l0l1OOOO1l1l0O0: O00Ol0ll100Ol0OO10Ol1( 142 | O00Ol0ll100Ol0OO10Ol1, l0O1ll0OO1010OOlll11l(O111l00lOOOllOOOllOlO, 143 | OOOl10l0l1OOOO1l1l0O0), O1lOO0ll10100OO0101lO(O111l00lOOOllOOOllOlO & 144 | OOOl10l0l1OOOO1l1l0O0, lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(0, 145 | l0O1ll0OO1010OOlll11l(l0O1ll0OO1010OOlll11l(4 ^ 1, 1), 146 | l0O1ll0OO1010OOlll11l(0 * 10 + 3, 1 ^ 0))), 0 ^ 0 * 15 + 1 ^ 0))) if 147 | OOOl10l0l1OOOO1l1l0O0 else O111l00lOOOllOOOllOlO, 148 | Ol11l1ll0l1lO11001O10, O1OOll11l0l1OO011OO11))(O10lOOllO10lOll0010OO( 149 | lO11l0O01l001O11l0101(l0O1ll0OO1010OOlll11l(l111OOl1OOlOlllO0lO10, 150 | lO11l0O01l001O11l0101(OOllOO11Ol00ll0O0l10O(~((104833219 ^ 370930734) & 151 | 812118641) & O1lO11l10O00OlO01OOOl(~(64298838 ^ 334580667) & 152 | O1lO11l10O00OlO01OOOl(62470664 * 13 + 9)), lO11l0O01l001O11l0101(0 * ( 153 | (0 * 4 + 2) * 5 + (0 * 9 + 3)), (0 * 8 + 0) * (15 ^ 4) + (0 * 8 + 5))), 154 | l0O1ll0OO1010OOlll11l(0 * 11 + 0, 0 ^ 3 ^ (5 ^ 2)))), 155 | lO11l0O01l001O11l0101(0 * l0O1ll0OO1010OOlll11l(0, 0 ^ 3), 156 | OOllOO11Ol00ll0O0l10O(0, 4 ^ 12 ^ 24) + (0 ^ 1 ^ 0))), ~ 157 | l0O1ll0OO1010OOlll11l(l111OOl1OOlOlllO0lO10, O10lOOllO10lOll0010OO( 158 | O1lO11l10O00OlO01OOOl(O10lOOllO10lOll0010OO(O10lOOllO10lOll0010OO(~ 159 | lO11l0O01l001O11l0101((10981333 * 13 + 1) * (7 * 2 + 0), 1 ^ 5), 160 | 33994789 ^ 70196807 ^ 391130512) | O10lOOllO10lOll0010OO( 161 | OOllOO11Ol00ll0O0l10O(204665102 ^ 78691548, 14) + 4, 162 | O1lO11l10O00OlO01OOOl(103392866 ^ 391130512)), 208713910 * (1 * 12 + 4 163 | ) + (0 * 10 + 2))), ~(~l0O1ll0OO1010OOlll11l(1998602624, (11494526 ^ 164 | 26275201) * (0 * 15 + 14) + (0 * 7 + 0)) & O1lO11l10O00OlO01OOOl( 165 | 3006484538 ^ 1949883224))))) | l0O1ll0OO1010OOlll11l( 166 | l0O1ll0OO1010OOlll11l(25513302 * 15 + 6, 873564420) ^ (146931 * 12 + 167 | 10 ^ 101249799 * 3 + 1), 4261706 ^ 15107909 ^ (1082012597 ^ 271158556 * 168 | 3 + 0)), O10lOOllO10lOll0010OO(O1lO11l10O00OlO01OOOl( 169 | lO11l0O01l001O11l0101(l111OOl1OOlOlllO0lO10 ^ lO11l0O01l001O11l0101( 170 | lO11l0O01l001O11l0101(((1524174 ^ 14026) * 16 + (2 * 5 + 2)) * 171 | l0O1ll0OO1010OOlll11l(10 ^ 7, 0 * 7 + 6), 4 ^ 14) * 172 | l0O1ll0OO1010OOlll11l(4 * 3 + 0 ^ 0 * 6 + 1, lO11l0O01l001O11l0101(1 * 173 | (0 * 8 + 7), 0)), OOllOO11Ol00ll0O0l10O(0, 4 * 2 + 0) + (0 * 7 + 1) ^ 174 | 5), l0O1ll0OO1010OOlll11l(0, lO11l0O01l001O11l0101(((0 * 7 + 0) * (0 ^ 175 | 13) + 0) * (1 ^ 3 ^ (0 ^ 1)), 1))) & O1lO11l10O00OlO01OOOl( 176 | l111OOl1OOlOlllO0lO10 ^ OOllOO11Ol00ll0O0l10O((38591503 ^ 7830064) * ( 177 | 0 * 7 + 6) + 5 ^ (19848547 ^ 130996239), 0 * (6 ^ 12) + (1 ^ 8) - (4 ^ 178 | 3) + 2 * (~(0 * (6 ^ 12) + (1 ^ 8)) & (4 ^ 3))) + ( 179 | OOllOO11Ol00ll0O0l10O(OOllOO11Ol00ll0O0l10O(0 * 11 + 0, 5 ^ 9) + 0, (1 ^ 180 | 3) * (5 ^ 3) + (0 * 5 + 4)) + (2 ^ 4)))), OOllOO11Ol00ll0O0l10O( 181 | 27324865 * 13 + 7, 3) + (~(0 * 5 + 0) & (1 ^ 0) | 0 * 5 + 0 & ~(1 ^ 0) 182 | ))), O1lOO0ll10100OO0101lO(0 * ((0 ^ 1) - 4 + 2 * (~(0 ^ 1) & 4)) + (0 * 183 | (1 * 5 + 4) + (0 * 14 + 1)), l0O1ll0OO1010OOlll11l(2 * 7 + 2 ^ 1 * 9 + 184 | 0, 5 * 11 + 2))), (205488027 ^ 8489386 ^ 54535334) * ((0 * 8 + 4) * 4 + 185 | 0) + (7 ^ 13 ^ 0 * 9 + 2)) == OOllOO11Ol00ll0O0l10O(246913, 0 * 12 + 7 ^ 186 | (2 ^ 0)) + ((0 * (4 ^ 20) + 0) * (0 * 9 + 4 ^ 0 * 7 + 1) + (0 * 6 + 2)) 187 | -------------------------------------------------------------------------------- /astobfuscate.py: -------------------------------------------------------------------------------- 1 | import ast 2 | from ast import * 3 | import astor.code_gen 4 | import random 5 | import os 6 | import sys 7 | import copy 8 | 9 | 10 | def random_string(minlength, maxlength): 11 | """ 12 | Horrifying variable names consisting entirely of lookalikes: 13 | Digit ones, lowercase els, digit zeroes, uppercase ohs 14 | """ 15 | return random.choice('lO') + ''.join(random.choice('lO10') for _ in range(random.randint(minlength, maxlength))) 16 | 17 | 18 | def import_node(name, newname, froms=None): 19 | if froms: 20 | froms = [Str(from_name) for from_name in froms] 21 | else: 22 | froms = [] 23 | """Import module obfuscation""" 24 | # import sys -> sys = __import__('sys', globals(), locals(), [], 0) 25 | return Assign( 26 | targets=[Name(id=newname, ctx=Store())], 27 | value=Call(func=Name(id='__import__', ctx=Load()), 28 | args=[Str(s=name), 29 | Call(func=Name(id='globals', ctx=Load()), args=[], 30 | keywords=[], starargs=None, kwargs=None), 31 | Call(func=Name(id='locals', ctx=Load()), args=[], 32 | keywords=[], starargs=None, kwargs=None), 33 | List(elts=froms, ctx=Load()), Num(n=0)], 34 | keywords=[], starargs=None, kwargs=None)) 35 | 36 | 37 | def obfuscate_binary(operator, newname): 38 | arg1 = random_string(20, 20) 39 | arg2 = random_string(20, 20) 40 | return Assign(targets=[Name(id=newname, ctx=Store())], 41 | value=Lambda(args=arguments(args=[arg(arg=arg1, annotation=None), arg(arg=arg2, annotation=None)], vararg=None, kwonlyargs=[], kw_defaults=[], kwarg=None, defaults=[]), 42 | body=BinOp(left=Name(id=arg1, ctx=Load()), op=operator(), right=Name(id=arg2, ctx=Load())))) 43 | 44 | 45 | def obfuscate_string(s): 46 | """Various String Obfuscation routines.""" 47 | # Vars we might use 48 | var1 = random_string(20, 20) 49 | var2 = random_string(20, 20) 50 | 51 | random_bytes = os.urandom(len(s)) 52 | 53 | # For xor combining two bytestrings 54 | pair1 = random_bytes 55 | pair2 = bytes([ 56 | x ^ y for x, y in zip(random_bytes, s.encode('utf-8')) 57 | ]) 58 | 59 | # Divisor for filtering into an empty list 60 | random_divisor = random.randint(2, 6) 61 | 62 | chars = list(filter(lambda x: ord(x) % random_divisor == 0, [chr(x) for x in range(0, 126)])) 63 | 64 | list_of_chars = ''.join([random.choice(chars) for _ in range(15)]) 65 | 66 | 67 | 68 | table0 = [ 69 | # '' -> '' 70 | lambda: Str(s=''), 71 | # Filter out all characters whose ascii values aren't divisible by a certain value, leaving an empty string 72 | lambda: Call(func=Attribute(value=Str(s=''), attr='join', ctx=Load()), args=[Call(func=Name(id='filter', ctx=Load()), args=[Lambda(args=arguments(args=[arg(arg=var1, annotation=None)], vararg=None, kwonlyargs=[], kw_defaults=[], kwarg=None, defaults=[]), body=Compare(left=BinOp(left=Call(func=Name(id='ord', ctx=Load()), args=[Name(id=var1, ctx=Load())], keywords=[]), op=Mod(), right=Num(n=random_divisor)), ops=[NotEq()], comparators=[Num(n=0)])), Bytes(s=list_of_chars)], keywords=[])], keywords=[]) 73 | ] 74 | 75 | table1 = [ 76 | # 'a' -> 'a' 77 | lambda x: Str(s=chr(x)), 78 | # 'a' -> chr(0x61) 79 | lambda x: Call(func=Name(id='chr', ctx=Load()), args=[Num(n=x)], 80 | keywords=[], starargs=None, kwargs=None), 81 | ] 82 | 83 | table = [ 84 | # 'abc' -> 'a' + 'bc' 85 | lambda x: BinOp(left=Str(s=x[:len(x)//2]), 86 | op=Add(), 87 | right=Str(s=x[len(x)//2:])), 88 | # 'abc' -> 'cba'[::-1] 89 | lambda x: Subscript(value=Str(s=x[::-1]), 90 | slice=Slice(lower=None, upper=None, 91 | step=Num(n=-1)), 92 | ctx=Load()), 93 | # xor two bytestrings together in a list comprehension 94 | lambda x: Call(func=Attribute(value=Str(s=''), attr='join', ctx=Load()), args=[GeneratorExp(elt=Call(func=Name(id='chr', ctx=Load()), args=[BinOp(left=Name(id=var1, ctx=Load()), op=BitXor(), right=Name(id=var2, ctx=Load()))], keywords=[]), generators=[comprehension(target=Tuple(elts=[Name(id=var2, ctx=Store()), Name(id=var1, ctx=Store())], ctx=Store()), iter=Call(func=Name(id='zip', ctx=Load()), args=[Bytes(s=pair1), Bytes(s=pair2)], keywords=[]), ifs=[], is_async=0)])], keywords=[]) 95 | ] 96 | # Make it much more likely for it to be a bitwise xor. They are much more difficult to understand. 97 | table.extend([table[2]] * 2) 98 | if not len(s): 99 | return random.choice(table0)() 100 | 101 | if len(s) == 1: 102 | return random.choice(table1)(ord(s)) 103 | 104 | return random.choice(table)(s) 105 | 106 | 107 | class Obfuscator(ast.NodeTransformer): 108 | def __init__(self, passes=1): 109 | ast.NodeTransformer.__init__(self) 110 | 111 | # imported modules 112 | self.imports = {} 113 | 114 | # Import values from modules 115 | self.from_imports = {} 116 | 117 | # The names of the imported values 118 | self.import_aliases = {} 119 | 120 | # global values (can be renamed) 121 | self.globs = {} 122 | 123 | # local variables 124 | self.locs = [] 125 | 126 | # Obfuscated operators 127 | self.binary_operators = {} 128 | 129 | self.unary_operators = {} 130 | 131 | # List of classes 132 | self.classes = [] 133 | 134 | # inside a function 135 | self.indef = False 136 | 137 | # Inside a class 138 | self.inclass = False 139 | 140 | # Number of passes to perform 141 | self.passes = passes 142 | 143 | # Whether we've renamed variables yet. 144 | self.renamed = False 145 | 146 | def obfuscate_global(self, name): 147 | newname = random_string(20, 20) 148 | self.globs[name] = newname 149 | return newname 150 | 151 | def obfuscate_local(self, name): 152 | # Rename the variable in the closest-in local namespace 153 | newname = random_string(20, 20) 154 | self.locs[0][name] = newname 155 | return newname 156 | 157 | def get_name(self, name): 158 | found_local = False 159 | 160 | # Loop through and try to find a local var in the closest containing namespace 161 | for local_namespace in self.locs: 162 | if name in local_namespace: 163 | name = local_namespace[name] 164 | found_local = True 165 | break 166 | 167 | # Otherwise fall back to global variables 168 | if not found_local: 169 | name = self.globs.get(name, name) 170 | 171 | return name 172 | 173 | def visit_Import(self, node): 174 | # Add a plain import 175 | newname = self.obfuscate_global(node.names[0].name) 176 | self.imports[node.names[0].name] = newname 177 | 178 | def visit_ImportFrom(self, node): 179 | # Add the module and all the aliases we're importing from it to their respective places 180 | module_name = self.obfuscate_global(node.module) 181 | self.from_imports[module_name] = {} 182 | self.import_aliases[node.module] = module_name 183 | for alias in node.names: 184 | self.from_imports[module_name][alias.name] = self.obfuscate_global(alias.name) 185 | 186 | def visit_Str(self, node): 187 | return obfuscate_string(node.s) 188 | 189 | def visit_NameConstant(self, node): 190 | # Don't mess with None 191 | if node.value is None: 192 | return node 193 | 194 | # Replace with a x % y == 0 195 | divisor = random.randint(2, 16) 196 | multiplicand = random.randint(4, 8) 197 | 198 | value = divisor * multiplicand 199 | 200 | if not node.value: 201 | # Make it not divisible, and therefore False 202 | value += random.randint(1, divisor - 1) 203 | return Compare(left=BinOp(left=Num(n=value), op=Mod(), right=Num(n=divisor)), ops=[Eq()], comparators=[Num(n=0)]) 204 | 205 | def visit_Num(self, node): 206 | obfus_type = random.randint(1, 3) 207 | 208 | if type(node.n) == float: 209 | # Obfuscate with integer ratio 210 | left, right = node.n.as_integer_ratio() 211 | return BinOp(left=Num(left), op=Div(), right=Num(right)) 212 | 213 | if obfus_type == 1: 214 | # 7 to (2 * 3) + 1 or likewise with another divisor 215 | d = random.randint(2, 16) 216 | return BinOp(left=BinOp(left=Num(node.n // d), op=Mult(), 217 | right=Num(n=d)), 218 | op=Add(), right=Num(node.n % d)) 219 | elif obfus_type == 2 and node.n: 220 | # 8 to 2 ^ 10 221 | random_num = random.getrandbits(node.n.bit_length()) 222 | return BinOp(left=Num(node.n ^ random_num), op=BitXor(), right=Num(random_num)) 223 | 224 | else: 225 | return node 226 | 227 | def visit_ClassDef(self, node): 228 | self.classes.append(node.name) 229 | 230 | # Don't obfuscate our class names or args. 231 | self.inclass = True 232 | node.body = [self.visit(x) for x in node.body if x] 233 | self.inclass = False 234 | 235 | return node 236 | 237 | def visit_Attribute(self, node): 238 | # Replace with a call to getattr() 239 | if isinstance(node.value, Name) and isinstance(node.value.ctx, Load): 240 | node.value = self.visit(node.value) 241 | return Call(func=Name(id='getattr', ctx=Load()), args=[ 242 | Name(id=node.value.id, ctx=Load()), Str(s=node.attr)], 243 | keywords=[], starargs=None, kwargs=None) 244 | # Visit the value 245 | node.value = self.visit(node.value) 246 | return node 247 | 248 | def visit_BinOp(self, node): 249 | """ 250 | Use a few equivalent arithmetic tricks to obfuscate certain operators, including +, -, |, &, ^, and ~ 251 | """ 252 | expandable = True 253 | is_int = True 254 | 255 | for candidate_node in ast.walk(node): 256 | if isinstance(candidate_node, Call): 257 | expandable = False 258 | 259 | if type(node.left) != Num or type(node.right) != Num or type(node.left.n) != int or type(node.right.n) != int: 260 | is_int = False 261 | 262 | left_visited = self.visit(copy.deepcopy(node.left)) 263 | 264 | right_visited = self.visit(copy.deepcopy(node.right)) 265 | 266 | if type(node.op) == Add and random.randint(1, 10) == 1 and expandable and is_int: 267 | # Obfuscate using Mixed Binary Arithmetic 268 | # Only if we can guarantee it's an int 269 | # x + y -> (x & y) + (x | y) 270 | # x + y -> (x ^ y) + 2 * (x & y) 271 | return random.choice([ 272 | BinOp(left=BinOp(left=left_visited, op=BitXor(), right=right_visited), op=Add(), right=BinOp(left=Num(n=2), op=Mult(), right=BinOp(left=left_visited, op=BitAnd(), right=right_visited))), 273 | 274 | BinOp(left=BinOp(left=left_visited, op=BitAnd(), right=right_visited), op=Add(), right=BinOp(left=left_visited, op=BitOr(), right=right_visited)) 275 | ]) 276 | 277 | elif type(node.op) == Sub and random.randint(1, 10) == 1 and expandable and is_int: 278 | # Sub replacements 279 | # Same as addition, just with negative right hand side 280 | # x - y -> (x & ~y + 1) + (x | ~y + 1) 281 | # x - y -> (x ^ ~y + 1) + 2 * (x & ~y + 1) 282 | return random.choice([ 283 | BinOp(left=BinOp(left=Num(n=2), op=Mult(), right=BinOp(left=left_visited, op=BitOr(), right=BinOp(left=UnaryOp(op=Invert(), operand=right_visited), op=Add(), right=Num(n=1)))), op=Sub(), right=BinOp(left=left_visited, op=BitXor(), right=BinOp(left=UnaryOp(op=Invert(), operand=right_visited), op=Add(), right=Num(n=1)))), 284 | 285 | BinOp(left=BinOp(left=left_visited, op=BitOr(), right=BinOp(left=UnaryOp(op=Invert(), operand=right_visited), op=Add(), right=Num(n=1))), op=Add(), right=BinOp(left=left_visited, op=BitAnd(), right=BinOp(left=UnaryOp(op=Invert(), operand=right_visited), op=Add(), right=Num(n=1)))) 286 | ]) 287 | 288 | elif type(node.op) == BitOr and random.randint(1, 10) == 1 and expandable: 289 | # BitOr replacements: 290 | # x | y -> (x ^ y) | (x & y) 291 | # Or using NAND logic: 292 | # x | y -> ~(~(x & x) & ~(y & y)) 293 | return random.choice([ 294 | BinOp(left=BinOp(left=left_visited, op=BitXor(), right=right_visited), op=BitOr(), right=BinOp(left=left_visited, op=BitAnd(), right=right_visited)), 295 | 296 | UnaryOp(op=Invert(), operand=BinOp(left=UnaryOp(op=Invert(), operand=BinOp(left=left_visited, op=BitAnd(), right=right_visited)), op=BitAnd(), right=UnaryOp(op=Invert(), operand=BinOp(left=right_visited, op=BitAnd(), right=right_visited)))) 297 | ]) 298 | 299 | elif type(node.op) == BitAnd and random.randint(1, 10) == 1 and expandable: 300 | # BitAnd replacements: 301 | # x & y -> (x | y) - (x ^ y) 302 | # Or using NAND logic: 303 | # x & y -> ~(~(x & y) & ~(x & y)) 304 | return random.choice([ 305 | BinOp(left=BinOp(left=left_visited, op=BitOr(), right=right_visited), op=Sub(), right=BinOp(left=left_visited, op=BitXor(), right=right_visited)), 306 | 307 | UnaryOp(op=Invert(), operand=BinOp(left=UnaryOp(op=Invert(), operand=BinOp(left=left_visited, op=BitAnd(), right=right_visited)), op=And(), right=UnaryOp(op=Invert(), operand=BinOp(left=left_visited, op=BitAnd(), right=right_visited)))) 308 | ]) 309 | 310 | elif type(node.op) == BitXor and random.randint(1, 10) == 1 and expandable: 311 | # BitXor replacements: 312 | # x ^ y -> x - y + 2 * (~x & y) 313 | # x ^ y -> ~(x & y) & ~(~x & ~y) 314 | # x ^ y -> (~x & y) | (x & ~y) 315 | return random.choice([ 316 | BinOp(left=BinOp(left=left_visited, op=Sub(), right=right_visited), op=Add(), right=BinOp(left=Num(n=2), op=Mult(), right=BinOp(left=UnaryOp(op=Invert(), operand=left_visited), op=BitAnd(), right=right_visited))), 317 | 318 | BinOp(left=UnaryOp(op=Invert(), operand=BinOp(left=left_visited, op=BitAnd(), right=right_visited)), op=BitAnd(), right=UnaryOp(op=Invert(), operand=BinOp(left=UnaryOp(op=Invert(), operand=left_visited), op=BitAnd(), right=UnaryOp(op=Invert(), operand=right_visited)))), 319 | 320 | BinOp(left=BinOp(left=UnaryOp(op=Invert(), operand=left_visited), op=BitAnd(), right=right_visited), op=BitOr(), right=BinOp(left=left_visited, op=BitAnd(), right=UnaryOp(op=Invert(), operand=right_visited))) 321 | ]) 322 | 323 | # Make a lambda expression for the operator, and have a 1/4 chance of using it 324 | # This lambda definition will be stuck right at the top of the file in the visit_Module() function 325 | try: 326 | if type(node.op) not in self.binary_operators: 327 | newname = random_string(20, 20) 328 | self.binary_operators[type(node.op)] = newname 329 | if random.randint(1, 4) == 1: 330 | name = self.binary_operators[type(node.op)] 331 | return Call(func=Name(self.globs.get(name, name), ctx=Load()), args=[left_visited, right_visited], keywords=[]) 332 | else: 333 | node.left = left_visited 334 | node.right = right_visited 335 | return node 336 | except: 337 | node.left = left_visited 338 | node.right = right_visited 339 | return node 340 | 341 | def visit_UnaryOp(self, node): 342 | node.operand = self.visit(node.operand) 343 | 344 | # Basically the same as BinOp 345 | try: 346 | if type(node.op) not in self.unary_operators: 347 | newname = random_string(20, 20) 348 | self.unary_operators[type(node.op)] = newname 349 | if random.randint(1, 2) == 1: 350 | name = self.unary_operators[type(node.op)] 351 | return Call(func=Name(self.get_name(name), ctx=Load()), args=[node.operand], keywords=[]) 352 | else: 353 | return node 354 | except: 355 | return node 356 | 357 | def visit_AugAssign(self, node): 358 | 359 | if type(node.target) == Name: 360 | # Just replace the name with a non-augmented assignment 361 | # x += 3 362 | # x = x + 3 363 | return self.visit(Assign(targets=[Name(node.target.id, ctx=Store())], 364 | value=BinOp(left=Name(node.target.id, ctx=Load()), op=node.op, right=node.value))) 365 | elif type(node.target) == Attribute and type(node.target.value) == Name: 366 | # Replace a attribute with a non-augmented assignment 367 | # name.attr /= 3 368 | # name.attr = name.attr / 3 369 | attribute = node.target 370 | 371 | # Grab versions of our attribute with both store and reload contexts. 372 | storeattribute = copy.deepcopy(attribute) 373 | 374 | loadattribute = copy.deepcopy(attribute) 375 | 376 | storeattribute.ctx = Store() 377 | 378 | loadattribute.ctx = Load() 379 | 380 | storeattribute.value.ctx = Load() 381 | 382 | loadattribute.value.ctx = Load() 383 | 384 | return self.visit(Assign(targets=[storeattribute], 385 | value=BinOp(left=loadattribute, op=node.op, right=node.value))) 386 | else: 387 | # I don't wont to go through all the possible cases, leave as-is 388 | node.value = self.visit(node.value) 389 | 390 | return node 391 | 392 | def visit_Assign(self, node): 393 | node.value = self.visit(node.value) 394 | 395 | # Visit the targets if they're not attributes 396 | # Visiting an attribute will result in trying to assign to a function call 397 | node.targets = [self.visit(x) if type(x) != Attribute else x for x in node.targets] 398 | 399 | return node 400 | 401 | def visit_FunctionDef(self, node): 402 | # Test to see if there's a keyword-only argument specifying that we shouldn't 403 | # Obfuscate the name and arguments 404 | no_obfuscate = 'ast_no_obfuscate' in [arg.arg for arg in node.args.kwonlyargs] 405 | 406 | # If we're already in a function definition make sure we don't close out of it 407 | if self.indef == True: 408 | already_indef = True 409 | else: 410 | already_indef = False 411 | self.indef = True 412 | 413 | # Add a new local namespace for this function 414 | self.locs.insert(0, {}) 415 | 416 | # If we haven't already renamed stuff, do that 417 | if not self.renamed: 418 | # In a class or not, if the no_obfuscate flag is there, remove it and simply keep the name and args as-is 419 | if no_obfuscate: 420 | self.globs[node.name] = node.name 421 | # Purge the undesirable flag for no obfuscation 422 | node.args.kwonlyargs = list(filter(lambda arg: arg.arg != 'ast_no_obfuscate', node.args.kwonlyargs)) 423 | 424 | # If we're not in a class and allowed to obfuscate, do both name and args 425 | elif not self.inclass: 426 | node.name = self.obfuscate_global(node.name) 427 | for arg in node.args.args: 428 | arg.arg = self.obfuscate_local(arg.arg) 429 | 430 | # If we're in a class, only rename args 431 | elif self.inclass: 432 | for arg in node.args.args: 433 | arg.arg = self.obfuscate_local(arg.arg) 434 | 435 | # Visit the function body, possibly recursing into another definition 436 | node.body = [self.visit(x) for x in node.body] 437 | 438 | # Handle nested function defs 439 | if not already_indef: 440 | self.indef = False 441 | 442 | # Remove our function namespace 443 | self.locs.pop(0) 444 | return node 445 | 446 | def visit_Lambda(self, node): 447 | # Test to see if there's a keyword-only argument specifying that we shouldn't 448 | # Obfuscate the name and arguments 449 | no_obfuscate = 'ast_no_obfuscate' in [arg.arg for arg in node.args.kwonlyargs] 450 | 451 | # If we're already in a function definition make sure we don't close out of it 452 | if self.indef == True: 453 | already_indef = True 454 | else: 455 | already_indef = False 456 | self.indef = True 457 | 458 | # Add a new local namespace for this function 459 | self.locs.insert(0, {}) 460 | 461 | # If we haven't already renamed stuff, do that 462 | if not self.renamed: 463 | for arg in node.args.args: 464 | arg.arg = self.obfuscate_local(arg.arg) 465 | 466 | # Visit the function body, possibly recursing into another definition 467 | node.body = self.visit(node.body) 468 | 469 | # Handle nested function defs 470 | if not already_indef: 471 | self.indef = False 472 | 473 | # Remove our function namespace 474 | self.locs.pop(0) 475 | return node 476 | 477 | def visit_Name(self, node): 478 | # obfuscate known globals and locals 479 | if not self.renamed and not self.inclass and isinstance(node.ctx, Store): 480 | if not self.indef and node.id not in self.globs: 481 | node.id = self.obfuscate_global(node.id) 482 | if self.indef and node.id not in self.locs[0]: 483 | node.id = self.obfuscate_local(node.id) 484 | 485 | node.id = self.get_name(node.id) 486 | 487 | return node 488 | 489 | def visit_Module(self, node): 490 | 491 | # Run our obfuscation layers times 492 | for i in range(self.passes): 493 | node.body = [y for y in (self.visit(x) for x in node.body) if y] 494 | self.renamed = True 495 | 496 | # Add imports 497 | for name, newname in self.imports.items(): 498 | node.body.insert(0, import_node(name, newname)) 499 | 500 | # Add imports with specific names import 501 | # E.G: 502 | # from math import log, sqrt 503 | for name, newname in self.import_aliases.items(): 504 | for alias in self.from_imports[newname].keys(): 505 | node.body.insert(0, Assign(targets=[Name(id=self.from_imports[newname][alias], ctx=Store())], 506 | value=Attribute( 507 | value=Name(id=newname, ctx=Load()), 508 | attr=alias 509 | ))) 510 | node.body.insert(0, import_node(name, newname, self.from_imports[newname].keys())) 511 | 512 | node.body = [self.visit(x) for x in node.body] 513 | 514 | # Add lambdas for each obfuscated operator 515 | for operator, newname in self.binary_operators.items(): 516 | node.body.insert(0, obfuscate_binary(operator, newname)) 517 | 518 | for operator, newname in self.unary_operators.items(): 519 | arg1 = random_string(20, 20) 520 | node.body.insert(0, Assign(targets=[Name(id=newname, ctx=Store())], 521 | value=Lambda(args=arguments(args=[arg(arg=arg1, annotation=None)], vararg=None, kwonlyargs=[], kw_defaults=[], kwarg=None, defaults=[]), 522 | body=UnaryOp(operand=Name(arg1, ctx=Load()), op=operator())))) 523 | 524 | return node 525 | 526 | 527 | class GlobalsEnforcer(ast.NodeTransformer): 528 | def __init__(self, globs): 529 | ast.NodeTransformer.__init__(self) 530 | self.globs = {} 531 | 532 | def visit_Name(self, node): 533 | node.id = self.globs.get(node.id, node.id) 534 | return node 535 | 536 | 537 | if __name__ == '__main__': 538 | if len(sys.argv) < 3: 539 | exit(0) 540 | 541 | if len(sys.argv) == 4: 542 | passes = int(sys.argv[3]) 543 | else: 544 | passes = 1 545 | 546 | if sys.argv[1] == '-': 547 | root = ast.parse(sys.stdin.read()) 548 | else: 549 | root = ast.parse(open(sys.argv[1], 'rb').read()) 550 | 551 | if sys.argv[2] == '-': 552 | file_obj = sys.stdin 553 | else: 554 | file_obj = open(sys.argv[2], 'w') 555 | 556 | # obfuscate the AST 557 | obf = Obfuscator(passes=passes) 558 | root = obf.visit(root) 559 | 560 | # resolve all global names 561 | root = GlobalsEnforcer(obf.globs).visit(root) 562 | 563 | file_obj.write(astor.code_gen.to_source(root, indent_with=' ')) 564 | 565 | file_obj.close() 566 | -------------------------------------------------------------------------------- /test_obfuscated.py: -------------------------------------------------------------------------------- 1 | OOOll11l111ll0000l1OO = lambda OOl00l001l10l0010lll0: ~OOl00l001l10l0010lll0 2 | llOl0OOl0O11l0OOlO10O = (lambda lO0lOl1l0OOO0ll111O01, 3 | Ol0ll1O0l00O101lll1l0: lO0lOl1l0OOO0ll111O01 / Ol0ll1O0l00O101lll1l0) 4 | ll11O1ll01lO11Ol101OO = (lambda l1O01l1000O000OOOlOO1, 5 | O0O0O01OO1lO0l11000l0: l1O01l1000O000OOOlOO1 * O0O0O01OO1lO0l11000l0) 6 | OO11lO0101l01O0OlO1O1 = (lambda O1O101lOOl0l0l1OlOlOl, 7 | lO10OO00000l101O11Oll: O1O101lOOl0l0l1OlOlOl ^ lO10OO00000l101O11Oll) 8 | l1l1l011OO1l1l1O0l011 = (lambda lO11l1lOOOl10Olll1110, 9 | ll0O100l0O1l0OO1OOlll: lO11l1lOOOl10Olll1110 // ll0O100l0O1l0OO1OOlll) 10 | ll0O1Ol0l1l01OlOlOl00 = (lambda Ol1l0OOlOl10Ol1000111, 11 | l1OO1Oll10lO0110010Ol: Ol1l0OOlOl10Ol1000111 % l1OO1Oll10lO0110010Ol) 12 | O1OOl0l001l00l01llO00 = (lambda OllO0Ol0OO10l1O000lOO, 13 | l1001l110O0O0lllOlOl0: OllO0Ol0OO10l1O000lOO + l1001l110O0O0lllOlOl0) 14 | Ol01l0Ol10l1O1lO110O0 = __import__(''.join(chr(ll1llO1O010Ol110lOll1 ^ 15 | Ol1lO10Ol10Ol1ll11O10) for Ol1lO10Ol10Ol1ll11O10, ll1llO1O010Ol110lOll1 in 16 | zip(b'\xf8\x9c', b'\x97\xef')), globals(), locals(), [''.join(chr( 17 | OO0O001100OOlO0O0lO00 ^ lOl11Ol10101110Oll0Ol) for 18 | lOl11Ol10101110Oll0Ol, OO0O001100OOlO0O0lO00 in zip(b'\xddv\x96\xb3Prf', 19 | b'\xa8\x04\xf7\xdd4\x1d\x0b'))], 0) 20 | llO1OO0l1ll10l010O0ll = getattr(Ol01l0Ol10l1O1lO110O0, 'urandom') 21 | lO01l11l0OllO1l1Ol0O0 = __import__(''.join(chr(lOO11lO0O1O000O0ll001 ^ 22 | OO1O0O0O0OOll11l101l0) for OO1O0O0O0OOll11l101l0, lOO11lO0O1O000O0ll001 in 23 | zip(b'}\xbd*\xac\x82\x1f\x95', b'\x1a\xd8^\xdc\xe3l\xe6')), globals(), 24 | locals(), [], 0 * 4 + 0) 25 | l1O0l0OllO010ll0O10lO = getattr(lO01l11l0OllO1l1Ol0O0, ''.join(filter(lambda 26 | ll11l0lOOll0Ol0OOl010: ord(ll11l0lOOll0Ol0OOl010) % 2 != 0, 27 | '\x18pp,.Z\x0e\x004RLJ 2P')).join(filter(lambda l1ll110OO0OlO111l0Ol0: 28 | ll0O1Ol0l1l01OlOlOl00(ord(l1ll110OO0OlO111l0Ol0), 2 ^ 0) != 0, 29 | 'D<@x6|\n2TR\n\x0c4\\4')).join(filter(lambda OO0OO1O11O01l111010ll: 30 | ll0O1Ol0l1l01OlOlOl00(ord(OO0OO1O11O01l111010ll), O1OOl0l001l00l01llO00 31 | (ll11O1ll01lO11Ol101OO(0 * (6 ^ 3) + 1, 3 ^ 6), 1)) != 0, 32 | 'Z`\x060l\x00`T\x06$6<*\x12T')).join(chr(OO11lO0101l01O0OlO1O1( 33 | O1O0Ol1ll10O00lO10111, Oll11l00l1Ol1Ol10O0OO)) for 34 | Oll11l00l1Ol1Ol10O0OO, O1O0Ol1ll10O00lO10111 in zip( 35 | b'fkBP!G^\xf1\xd3~-', b'\x11\x02,\x0fF"*\x81\xb2\r^')))( 36 | O1OOl0l001l00l01llO00(''.join(filter(lambda O010O01OOO110O0l1000l: ord( 37 | O010O01OOO110O0l1000l) % 6 != 0, '\x18*0$*`H\x00rr6\x06Fx')))) 105 | 106 | @staticmethod 107 | def add_2_static(lOO1lO1l0O0lOO00llO1O): 108 | return O1OOl0l001l00l01llO00(lOO1lO1l0O0lOO00llO1O, O1OOl0l001l00l01llO00 109 | (OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00(0 * 110 | (3 * 2 + 0), 0 * 3 + 0) * O1OOl0l001l00l01llO00((0 * 2 + 0) * (0 ^ 6), 111 | 2), 0), O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0 * 2 + 0, 5 ^ 0 * 112 | 2 + 0), 1 ^ 0)) * OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00(0 * 4, 113 | 0) ^ (0 ^ 1 ^ 0 * 2 + 0), OO11lO0101l01O0OlO1O1(0 * 4 + 2, 1 ^ 0)), 0)) 114 | 115 | 116 | if l1O0l0OllO010ll0O10lO: 117 | print(ll0O1Ol0l1l01OlOlOl00(''.join(filter(lambda OlO1O100l101l0l100OO1: 118 | ord(OlO1O100l101l0l100OO1) % (6 ^ 0) != 0, 119 | '\x12\x0cT$0*N\x00x\x1eZrN\x18\x12')).join(filter(lambda 120 | Ol0l01OllOO0O1l1O1Oll: ll0O1Ol0l1l01OlOlOl00(ord(Ol0l01OllOO0O1l1O1Oll 121 | ), O1OOl0l001l00l01llO00((2 ^ 0) * (0 ^ 2), 0 * 5 + 0)) != 0, 122 | 'Dp`( d$,l< H\\ p')).join(chr(OO11lO0101l01O0OlO1O1( 123 | l10lO0O1O0Ol1l1O010Ol, O0OO110100l1ll0l01O00)) for 124 | O0OO110100l1ll0l01O00, l10lO0O1O0Ol1l1O010Ol in zip( 125 | b'\xac\xfe\xec\xdb\xf8]\xcc`\xe5\x0c', 126 | b'\xe4\x9b\x80\xb7\x97q\xecE\x96-')), l1O0l0OllO010ll0O10lO)) 127 | else: 128 | print(''.join(filter(lambda lOOOO011O1O0ll0lllOO1: ord( 129 | lOOOO011O1O0ll0lllOO1) % 3 != 0, '9Zi\tEE\x06*9ll<\x00\x1ec')).join( 130 | chr(OO11lO0101l01O0OlO1O1(Ol01OO1lO1lOlOl11ll0l, lll0llO1O1lO1lO11O0OO 131 | )) for lll0llO1O1lO1lO11O0OO, Ol01OO1lO1lOlOl11ll0l in zip( 132 | b'\xcf\xb5\x91\xa2\x08\x0c\xf4\xcb=\x97;\xad\xd0\xd1\xcf\xd8', 133 | b'\x86\x95\xe2\xc7m,\x9c\xa4J\xb7R\xd9\xf0\xb8\xbc\xf9'))) 134 | ll11ll010ll0lO0OOll1O = O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO( 135 | OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00((0 * 4 + 2) * (0 * 5 + 2), 136 | 0 * 4 + 1) * O1OOl0l001l00l01llO00(((0 * 6 + 0) * (0 ^ 2) + 0) * (0 ^ 3 ^ 137 | 5), 4) + (0 ^ 1 ^ 1 * 3 + (0 * 5 + 0)), 1 ^ 6 ^ 2), 138 | O1OOl0l001l00l01llO00((0 * 4 + 0 ^ 0 * 6 + 1 ^ 0 * 5 + 0 ^ 0) * 139 | OO11lO0101l01O0OlO1O1(0 * 2 + 0, 0 ^ (1 ^ 0) ^ 0 * 3 + 2), 0)), 0 * 3 + 0) 140 | print(ll11ll010ll0lO0OOll1O, getattr(Data, O1OOl0l001l00l01llO00( 141 | O1OOl0l001l00l01llO00(chr(97), chr(25 * 4 + 0)) + O1OOl0l001l00l01llO00 142 | (chr(100), ''.join(chr(O1O00l0O1OOO11100l1l1 ^ l11ll01l1ll110OO1ll1O) for 143 | l11ll01l1ll110OO1ll1O, O1O00l0O1OOO11100l1l1 in zip(b'\x15n', b'J\\'))), 144 | ''.join(filter(lambda OO1Ol01O010llll1110OO: ll0O1Ol0l1l01OlOlOl00(ord( 145 | OO1Ol01O010llll1110OO), 5 ^ 3) != 0, '\x120\x18l*r6\x06x\x06*lN\x12`')) 146 | .join(filter(lambda l00l1l0l1Ol1000l1l1O1: ll0O1Ol0l1l01OlOlOl00(ord( 147 | l00l1l0l1Ol1000l1l1O1), 2 * 2 + 0) != 0, ',P\x1cH\x0c(\x18(| l8|0\x14') 148 | ).join(chr(OO11lO0101l01O0OlO1O1(lOO10Ol1llO11O0O0Ol00, 149 | Ol1OlO0l0O01l00Oll10l)) for Ol1OlO0l0O01l00Oll10l, 150 | lOO10Ol1llO11O0O0Ol00 in zip(b'\xa6\xf1\xe7\xc0\xd9(', 151 | b'\xf9\x92\x8b\xa1\xaa['))))(ll11ll010ll0lO0OOll1O), Data(). 152 | add_2_instance(ll11ll010ll0lO0OOll1O), Data().add_2_static( 153 | ll11ll010ll0lO0OOll1O), lOOl001O0l1ll00ll0llO(ll11ll010ll0lO0OOll1O, 154 | None), l1l1l011OO1l1l1O0l011(ll11ll010ll0lO0OOll1O, 155 | O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(O1OOl0l001l00l01llO00( 156 | ll11O1ll01lO11Ol101OO(ll11O1ll01lO11Ol101OO(0, 1 ^ 4) + (0 * 6 + 0), 157 | ll11O1ll01lO11Ol101OO(0 * 5 + 0, 0 ^ 4) + 0 ^ (5 ^ (1 ^ 0)) ^ 158 | OO11lO0101l01O0OlO1O1(0 ^ 1, 0)), O1OOl0l001l00l01llO00(((0 * 4 + 0) * 159 | (0 * 6 + 0 ^ 0 * 6 + 2) + (0 * (7 ^ 3) + 0)) * (7 ^ 2), 0)), 160 | OO11lO0101l01O0OlO1O1(0, ll11O1ll01lO11Ol101OO(0 * 5 + 0 ^ 161 | O1OOl0l001l00l01llO00((0 * 5 + 0) * (1 * 3 + 1), 0 * 5 + 1), (0 * (3 ^ 162 | 7) + 0) * (3 ^ 1 * 4 + 1) + (3 ^ 1)) + (0 * 5 + 0 ^ (1 ^ 0)))), 3 ^ 0 ^ 163 | 0 * 3 + 1)), O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00( 164 | OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00( 165 | 48488007018658 * (0 * 4 + 3), 0 * 5 + 1) * (6 ^ 3), 0 * 4 + 0), ( 166 | 3401231436234 ^ 7700487592872 ^ 431001224992 * 3 + 0) * 167 | O1OOl0l001l00l01llO00((0 * 2 + 0) * (5 ^ 3), 0 ^ 5) + ( 168 | ll11O1ll01lO11Ol101OO(0 * 6 + 0, 3 ^ 0) + 2)) * O1OOl0l001l00l01llO00( 169 | ll11O1ll01lO11Ol101OO(0 * 3 + 0 ^ (0 ^ 2), OO11lO0101l01O0OlO1O1(0 * 5 + 170 | 0, 0 ^ 2)), 0 ^ 1), OO11lO0101l01O0OlO1O1(0 * 4 + 0, 0 ^ 2)) / ( 171 | ll11O1ll01lO11Ol101OO(ll11O1ll01lO11Ol101OO(O1OOl0l001l00l01llO00(( 172 | 56219821954277 ^ 103473082791048) * (2 * 3 + 0), 0 * 5 + 1) * 2 + (0 * 173 | 5 + 0), OO11lO0101l01O0OlO1O1(OO11lO0101l01O0OlO1O1(1 ^ 0, 0 ^ 3), 2 * 174 | 3 + 1)) + O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0 * 3 + 0, 6 ^ 1 ^ 175 | 1), 0 * 6 + 1 ^ 2), ll11O1ll01lO11Ol101OO(O1OOl0l001l00l01llO00(0 * 5, 176 | 1), 7 ^ 2) + 0) + O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0, 177 | ll11O1ll01lO11Ol101OO(0 ^ 1, 7 ^ 3) + OO11lO0101l01O0OlO1O1(0 * 4 + 0, 178 | 0 ^ 1)), OO11lO0101l01O0OlO1O1(3 ^ 1, 0) ^ ll11O1ll01lO11Ol101OO(0, 3 ^ 179 | 0) + (1 ^ 0))), llOl0OOl0O11l0OOlO10O(O1OOl0l001l00l01llO00( 180 | ll11O1ll01lO11Ol101OO(ll11O1ll01lO11Ol101OO(ll11O1ll01lO11Ol101OO( 181 | 26140836792978 * 3 + 1, 3 * 2 + 0) + (0 * 6 + 5) ^ 55436797814742, (0 * 182 | 2 + 0 ^ (2 ^ 0)) * (3 ^ (1 ^ 0)) + 0) + (0 * 4 + 2), 0 * (0 * 5 + 3) + 183 | (0 ^ 1) ^ (ll11O1ll01lO11Ol101OO(0 * 6 + 0, 4 ^ 0) + (0 * 6 + 0)) * (0 * 184 | 2 + 0 ^ 1 * 5 + 1) + (0 * 5 + 3 ^ 0 * 6 + 0)), O1OOl0l001l00l01llO00( 185 | O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0 * 5 + 0, 2), 0 * 4 + 0) * 186 | (1 ^ 3 ^ (7 ^ 0 * 5 + 3)), OO11lO0101l01O0OlO1O1(0 * 2 + 0, 1 ^ 0))), 187 | OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00((672425601935642 * 6 + 3) * 188 | 4, 3) ^ 33450886664506172, 866695882794719 * 4 + 3 ^ ((89792312328410 * 189 | 3 + 1) * (1 ^ 3) + 0) * ((0 * 2 + 0) * 3 + 2) + (ll11O1ll01lO11Ol101OO( 190 | 0 * 5 + 0, 1 * 4 + 2) + 0)))), OOOll11l111ll0000l1OO( 191 | OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00((0 * 3 + 0) * (0 ^ 3 ^ 0 * 192 | 3 + 0), OO11lO0101l01O0OlO1O1(0, 1)), ll11O1ll01lO11Ol101OO(0 * 6 + 1, 193 | ll11O1ll01lO11Ol101OO(1, 1 * 2 + 0) + 0) + (0 * 6 + 0) ^ 194 | O1OOl0l001l00l01llO00(0 * (2 * 3 + 0), 0 * 2 + 1) ^ 0))) 195 | print(''.join(filter(lambda O0l00llO00Ol100lO1l0O: ord( 196 | O0l00llO00Ol100lO1l0O) % 2 != 0, '\x06(\x0c\x06XP\n\x0ed.DThXN')).join( 197 | filter(lambda O1011O10100001l0Ol11O: ord(O1011O10100001l0Ol11O) % (0 * 198 | 3 + 2) != O1OOl0l001l00l01llO00(0 * 4, 0 * 6 + 0), 199 | 'l>z8|JR\x1an6>\x08D.\x14')).join(filter(lambda O1l100001OOOO0l01O0O0: 200 | ord(O1l100001OOOO0l01O0O0) % (ll11O1ll01lO11Ol101OO( 201 | OO11lO0101l01O0OlO1O1(1, 0 * 3 + 0), 1 * (0 * 5 + 4) + (0 * 2 + 1)) + 202 | O1OOl0l001l00l01llO00((0 * 6 + 0) * 4, 0)) != O1OOl0l001l00l01llO00( 203 | ll11O1ll01lO11Ol101OO(0, OO11lO0101l01O0OlO1O1(1, 3 ^ 0)), 0 * 2 + 0), 204 | '\x142d\nUddKs2\x05i((7')).join(filter(lambda OOOOOlll11l1O0l110O01: 205 | ll0O1Ol0l1l01OlOlOl00(ord(OOOOOlll11l1O0l110O01), OO11lO0101l01O0OlO1O1 206 | (0 * 4 + 2 ^ 0 * 2 + 1, 0 * (4 ^ 1) + (0 ^ 1))) != 0 * 6 + 0, 207 | '||\n.\x1cD \x02Z\x10.0v\x18\x10')).join(chr(OO11lO0101l01O0OlO1O1( 208 | l00O0O1100lOO0l1O0ll1, O110l0OOOOl00O0l0O1l1)) for 209 | O110l0OOOOl00O0l0O1l1, l00O0O1100lOO0l1O0ll1 in zip( 210 | b'\xd8[nv#\xfd\xfe\xd52\xe7\r\x99\x98\xa6Z\x11\xe1\x89\x93\xdcu\xa9A\x84\x16m\x80T8M~8\xe5\\\xfd\xc8\xe9\rE\xe8O%\xc0\xc4&|\xef\x86\x14\x0bx' 211 | , 212 | b'\x9d#\x1e\x13@\x89\x9b\xb1\x08\xc78\xae\xb8\x93c1\xd4\xb0\xb3\xe9L\x89t\xbd6_\xb8t\x08cM\x08\xd5l\xcd\xf8\xd9=u\xd8\x7f\x15\xf0\xf4\x16L\xdb\xa698r' 213 | ))) 214 | ll11ll010ll0lO0OOll1O = ll11ll010ll0lO0OOll1O + O1OOl0l001l00l01llO00( 215 | ll11O1ll01lO11Ol101OO(O1OOl0l001l00l01llO00(((0 * 3 + 0) * 2 + ( 216 | ll11O1ll01lO11Ol101OO(0, 0 ^ 5) + 0)) * O1OOl0l001l00l01llO00( 217 | ll11O1ll01lO11Ol101OO(0 * 4 + (1 ^ 0), ll11O1ll01lO11Ol101OO(3, 0 * 4 + 218 | 2) + (0 * 5 + 0)), 0), ll11O1ll01lO11Ol101OO((0 * 2 + 0) * 5 + 0, 219 | O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00((0 * 3 + 0) * 2, 0 ^ 1) * 5, 220 | 0 * 6 + 1)) + O1OOl0l001l00l01llO00(0 * 5, 1 ^ 3)), 221 | OO11lO0101l01O0OlO1O1(OO11lO0101l01O0OlO1O1(0 * 5 + 0, 4), ((0 * 6 + 0) * 222 | (0 * 4 + 3) + 0) * (0 * 2 + 0 ^ 0 * 5 + 4) + (0 * 4 + 2))), 223 | ll11O1ll01lO11Ol101OO(ll11O1ll01lO11Ol101OO(0, 0 * (0 ^ 3) + 2) + (0 * 224 | 3 + 1 ^ 0), 3 ^ 0) + O1OOl0l001l00l01llO00((0 * 6 + 0) * 6, 0)) 225 | print(ll11ll010ll0lO0OOll1O) 226 | print(''.join(filter(lambda llOl000OO0ll110l1Ol0l: ord( 227 | llOl000OO0ll110l1Ol0l) % 5 != 0, 'U_\n#KF\x00s7\n#\x14#P\x05')).join( 228 | filter(lambda l1Ol101Ol1O110O1OO0O1: ord(l1Ol101Ol1O110O1OO0O1) % (2 ^ 229 | 0) != 0, 't0\x044\x0c.\x02xd8:h",$')).join(filter(lambda 230 | O0010l10111OOO0OO1O01: ord(O0010l10111OOO0OO1O01) % ((0 * 6 + (2 ^ 0)) * 231 | O1OOl0l001l00l01llO00(1 * 2, 0) + 0) != 0, 232 | '\x04\x0cPhhlxll \x0c\x08((D')).join(chr(OO11lO0101l01O0OlO1O1( 233 | l11100O0lOl111l00l0lO, OlO10O0l111lO0000O10l)) for 234 | OlO10O0l111lO0000O10l, l11100O0lOl111l00l0lO in zip( 235 | b'\x8cl\x9f\xc9\x07m^H\x002\xd5\xd8\x95', 236 | b'\x86^\xa8\xe9=\t;\xdf\xcey i-\xdc\x8e\x94\x93\\\xb7\x81H\xaf*' 277 | ))[::O1OOl0l001l00l01llO00((ll11O1ll01lO11Ol101OO(-1 ^ 0, 0 * 5 + 4) + 278 | (2 ^ 1)) * (0 * 4 + 0 ^ 3), ll11O1ll01lO11Ol101OO(0 * 3 + 0, 0 * 3 + 2) + 279 | (1 ^ 0)) ^ O1OOl0l001l00l01llO00(0 * (3 ^ 7), 0 * 6 + 1) ^ 0 * 3 + 0]) 280 | print(ll0O1Ol0l1l01OlOlOl00(OO11lO0101l01O0OlO1O1(ll11O1ll01lO11Ol101OO((0 * 281 | 5 + 2) * (1 * 4 + 0) + (1 ^ 3), O1OOl0l001l00l01llO00((0 ^ 3) * (3 ^ 1), 282 | 0)) + (0 ^ 2) ^ (15 ^ 48 ^ 17 * 4 + 3 ^ (0 * 4 + 0 ^ 9 * 3 + 0)), 283 | ll11O1ll01lO11Ol101OO(1 * (0 * 4 + 2) + (0 * 4 + 1), 1 * 6 + 0) + (2 * 284 | 2 + 0)), OO11lO0101l01O0OlO1O1(OO11lO0101l01O0OlO1O1(0 * 2 + 0 ^ (12 ^ 285 | 0), O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0, 4), 0) ^ (0 * 4 + 2) * 286 | (0 * 6 + 3) + (0 * 6 + 0)), 3 * 2 + 1 ^ 0 * 3 + 2)) == 287 | O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0 * (3 * 2 + 0) + 0, 288 | ll11O1ll01lO11Ol101OO(0, 1 * 4 + 0) + (0 * (6 ^ 2) + (2 ^ 1))), 289 | ll11O1ll01lO11Ol101OO(0 * 2 + 0, 0 ^ 1 * 3 + 0) + ( 290 | ll11O1ll01lO11Ol101OO(0, 3 ^ 0 ^ 6) + ((0 * 3 + 0) * (5 ^ 0) + (0 * 2 + 291 | 0)))), ll0O1Ol0l1l01OlOlOl00(ll11O1ll01lO11Ol101OO(0 ^ 28, 2 ^ 0) + 0, 292 | OO11lO0101l01O0OlO1O1(7, O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(1 ^ 293 | 0 * 2 + 0, O1OOl0l001l00l01llO00(OO11lO0101l01O0OlO1O1(0 * 4 + 0, 0 ^ 1 294 | ) * 5, 0 * 5 + 0)), OO11lO0101l01O0OlO1O1(0 ^ 3, (0 * 5 + 1) * 5 + (0 * 295 | 6 + 2))))) == O1OOl0l001l00l01llO00(0 * 5, 0), ll0O1Ol0l1l01OlOlOl00( 296 | ll11O1ll01lO11Ol101OO(2 * 6 + 0, O1OOl0l001l00l01llO00((0 ^ 1) * 297 | O1OOl0l001l00l01llO00((0 * 2 + 1) * (0 * 6 + 3), 1 * 2 + 0), 298 | O1OOl0l001l00l01llO00(0 * 3, 0 * 2 + 0))) + (ll11O1ll01lO11Ol101OO(0 * 299 | 2 + 0, 0 * 4 + 0 ^ 6) + O1OOl0l001l00l01llO00((0 ^ 2) * 2, 0 * 4 + 0)), 300 | O1OOl0l001l00l01llO00((0 ^ 1 ^ 3) * (7 ^ 3), 0)) == 0, 301 | ll0O1Ol0l1l01OlOlOl00(O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO((1 ^ 302 | 2) * (0 ^ 4) + (0 * 3 + 2), 2 ^ 0 * 3 + 1), 2 ^ 0), 303 | OO11lO0101l01O0OlO1O1(O1OOl0l001l00l01llO00((0 * 4 + 0 ^ 0 * 6 + 2) * 6, 304 | 0 ^ (1 ^ 3)) ^ 0 * (1 * 5 + 1) + (1 * 5 + 0), 0)) == 305 | O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(0, OO11lO0101l01O0OlO1O1(1, 306 | 2 ^ 1)), (0 * 4 + 0) * 5 + 0), ll0O1Ol0l1l01OlOlOl00( 307 | O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO(56, 0 * 3 + 1 ^ (0 * 4 + 1) * 308 | (0 * 5 + 3) + (0 * 4 + 0)), O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO 309 | (0, 1 ^ 7), 0)), O1OOl0l001l00l01llO00(ll11O1ll01lO11Ol101OO( 310 | ll11O1ll01lO11Ol101OO(2, 3 ^ 1) + (0 * 3 + (0 * 3 + 1)), 311 | O1OOl0l001l00l01llO00(((0 * 5 + 0) * (1 * 3 + 2) + (0 * 4 + 1)) * 312 | OO11lO0101l01O0OlO1O1(5 ^ 2, 1 * 2 + 1), 0)), (0 * 4 + 0) * ((0 * 2 + 1 313 | ) * 3 + (0 * 6 + 1)) + (0 * 5 + 1 ^ 0)) ^ (0 * 5 + 0 ^ 0 * 6 + 5)) == ( 314 | 0 * 5 + 0) * (1 * 2 + 0) + (0 * 5 + 0)) 315 | print(O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00(O1OOl0l001l00l01llO00(''. 316 | join(filter(lambda OO0l00OOlO00100110O1l: ord(OO0l00OOlO00100110O1l) % 317 | 4 != 0 * 6 + 0, ' 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . --------------------------------------------------------------------------------