This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # . . . | |
| # | |
| # . ● . | |
| # | |
| # | |
| # . . | |
| import math | |
| import random | |
| #._//_______________________________________/____________________________________/___. | |
| class _929_NFM: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # masxor.py(v1.1.122) builds, test & makes extreme complex xor encryption py modules | |
| # Since getting skilled @slots programming....I guess it's up to me to do this work, | |
| # so you can have something awesome regarding the classic XOR encryption scheme. Not | |
| # promising anything perfect, however I'll give it my better thoughts and patience. | |
| # The goal with this module is to surpass current AI levels of competence with xor | |
| # encryption/decryption, whereof I've noticed more than once all make a mess of xor | |
| # encryption/decryption quickly with advanced request. Not placing too many monkeys |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # 975EHTT ENCRYPTION BASE | |
| import math | |
| import hashlib | |
| #×××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××× | |
| class DTD: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # OOPS! It seems you have reached a uncompleted module. If | |
| # you think this is a mistake, you can contact by email or | |
| # choose to attempt finishing it yourself. Not recommended | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| section .data | |
| SOCKET_ERROR db ") XFH-:Socket creation failed", 0 | |
| BIND_ERROR db ") XFH-:Bind failed", 0 | |
| RECV_ERROR db ") XFH-:Receive failed", 0 | |
| ENCRYPT_ERROR db ") XFH-:Encryption failed", 0 | |
| DECRYPT_ERROR db ") XFH-:Decryption failed", 0 | |
| BUFFER_SIZE equ 1024 | |
| buffer resb BUFFER_SIZE | |
| encrypted_buffer resb BUFFER_SIZE | |
| client_addr resb 16 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Cecil Maps 2025, Feb 7 | |
| # _______________________________________________________________________________ | |
| # _______________________________________________________________________________ | |
| # _______________________________________________________________________________ | |
| # _______________________________________________________________________________ | |
| import math | |
| # _______________________________________________________________________________ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #___________________________________________________________________________________ | |
| # XFH-DFT UPAN/INET KEY GEN (completed module final, Feb 7, 2025) | |
| # github.com/lastforkbender/staqtapp | |
| # rcttcr5@gmail | |
| #___________________________________________________________________________________ | |
| #___________________________________________________________________________________ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #___________________________________________________________________________________ | |
| #___________________________________________________________________________________ | |
| import math | |
| from collections import deque | |
| #___________________________________________________________________________________ | |
| class RITA: | |
| def __init__(self, angles: list): | |
| self.angles = angles |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # ________________ . | |
| # . /.,------------,.\ • . | |
| # /// .---------__|\\ | |
| # \\\ `------. .// . | |
| # . `\\`--...._ `;//' . • | |
| # `\\.-,___;.//' . | |
| # `\\-..-//' ` | |
| # . `\\//' • . : | |
| # . "" | |
| import time |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import math | |
| def star_of_david_angular_root(x_positions, y_positions, limit): | |
| return [math.ceil((math.sqrt((math.sqrt(x+y+1))-1)+(y/2)/(math.atan((x*y+y)/y)/(math.cos((math.sin((y+1)**math.pi)))%len(y_positions))))) for x in x_positions for y in y_positions if (x <= limit and (x != x-1) or True)] | |
| #====================================================================================== | |
| # EXAMPLE: | |