Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ## N to the power of (2 ** -1) produces the square root of N
- def ABS(INPUT): return (INPUT * INPUT) ** (2 ** -1)
- def ATAN(INPUT): return 0 if INPUT == 0 else INPUT / ABS(INPUT)
- #A trick I invented to produce -1 for numbers < 0 else 1
- def TRICK(number): return ATAN(number + ATAN(number ** ATAN(number)))
- #Both of these encoding algorithms work (they can both be decoded with the same decoder invented by Caesar from Africa)
- def ENCRYPT(BASE, INPUT): return ((BASE * 2) + TRICK(INPUT)) * (2 ** ABS(INPUT))
- def ENCRYPT2(BASE, INPUT): return ((BASE / 2) + TRICK(INPUT)) / (2 ** ABS(INPUT))
- def PERMUTE_INTEGERS(INT, *DIMENSIONS):
- return 0
- #Please test safely. Only works for positive integers encoded. This is not the decoder invented by Caesar from africa.
- def DECRYPT(BASE):
- BASE_BIT = 0
- while BASE % 2 == 0:
- BASE = BASE / 2
- BASE_BIT = BASE_BIT + 1
- BASE = (BASE - 1) / 2
- return BASE, BASE_BIT
- BASE = 0
- BASE = ENCRYPT(BASE, 10)
- BASE = ENCRYPT(BASE, 256)
- print("ENCRYPTION_START: " + str(BASE))
- while BASE != 0:
- BASE,BIT = DECRYPT(BASE)
- print("BIT: " + str(BIT))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement