Created
May 17, 2024 02:29
-
-
Save lastforkbender/5c39bcb7f53ef4ffd14a98aeccee3b28 to your computer and use it in GitHub Desktop.
7-digit cXV Menorah Encoded Palindrome
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
| # This palindrome function included of the Staqtapp1.2 hybrid env-var python library: | |
| # https://github.com/lastforkbender/staqtapp | |
| def outerLoopCxvEncodedMenorahPalindrome(tetBase: int, vssvAddr: str) -> str: | |
| # Returns semi-proper outer-halfloop encoded 7-digit cXV Menorah type palindrome int. | |
| # @tetBase a 5-digit palindrome number; first & last digit being zero is impossible. | |
| # @vssvAddr a 31-digit random number converted to str type, can be any random and -- | |
| # will be figured with @tetBase as a neutral, odd or even junctional loop(s) resolved. | |
| # A cXV type encoding inward of middle semi-loop or most inner semi-loop is beyond | |
| # a example. Such extreme enumerations require many exponent rotations pre-arranged | |
| # and are done with rotational variable symbology, arrow stability and symmetry avgs. | |
| # Menorah based mathematics is multi-looping, without any non-exist pair-center loop. | |
| # The example below proves this by use of a determined overall shift palindrome order | |
| # whereof znero cannot escape a placeholding of one whatsoever, of any number system. | |
| # Nothing *is* impossible, not nothing *is* possible for all real menorah mathematics, | |
| # time travel, pre-arranged [?karma] and a very very large space vehicle/city design. | |
| import math as m | |
| cpnIdSw = False | |
| tbPlndrmLft = str(tetBase)[0:3] | |
| tbPlndrmLftInt = int(tbPlndrmLft) | |
| tbPlndrmRht = str(tetBase)[2:5] | |
| tbPlndrmRhtInt = int(tbPlndrmRht) | |
| if tbPlndrmLftInt == tbPlndrmRhtInt: tbPlndrmTol = 3 | |
| elif tbPlndrmLftInt > tbPlndrmRhtInt: | |
| tbPlndrmDim = m.floor(m.tan(tbPlndrmLftInt-tbPlndrmRhtInt)) | |
| if tbPlndrmDim+tbPlndrmRhtInt >= tbPlndrmLftInt-tbPlndrmDim: tbPlndrmTol = 4 | |
| else: tbPlndrmTol = 3 | |
| elif tbPlndrmLftInt < tbPlndrmRhtInt: | |
| tbPlndrmDim = m.floor(m.tan(tbPlndrmRhtInt+tbPlndrmLftInt)) | |
| if tbPlndrmDim-tbPlndrmLftInt <= tbPlndrmRhtInt+tbPlndrmDim: tbPlndrmTol = 4 | |
| else: tbPlndrmTol = 3 | |
| tbPlndrmDim = len(vssvAddr)-1 | |
| lpCntr = 0 | |
| lpDimCntr = 0 | |
| lbLstLft = [] | |
| lbLstRht = [] | |
| lbLstCnd = [] | |
| while lpCntr < tbPlndrmDim: | |
| lpDimCntr+=1 | |
| if len(lbLstLft) == tbPlndrmTol: | |
| if lbLstLft[0] == '0': lbLstLft[0] = '1' | |
| if lbLstRht[0] == '0': lbLstRht[0] = '1' | |
| jnLftCnd = int(''.join(lbLstLft)) | |
| jnRhtCnd = int(''.join(lbLstRht)) | |
| if jnLftCnd == jnRhtCnd: lbLstCnd.append(str(tbPlndrmTol+2)) | |
| elif jnLftCnd > jnRhtCnd: | |
| if (jnLftCnd-jnRhtCnd)*2 < tbPlndrmTol+jnRhtCnd: lbLstCnd.append(str(tbPlndrmTol+1)) | |
| else: lbLstCnd.append(str(tbPlndrmTol-1)) | |
| elif jnLftCnd < jnRhtCnd: | |
| if (jnRhtCnd-jnLftCnd)*2 > tbPlndrmTol+jnRhtCnd: lbLstCnd.append(str(tbPlndrmTol-1)) | |
| else: lbLstCnd.append(str(tbPlndrmTol+1)) | |
| lbLstLft = [f'{vssvAddr[tbPlndrmDim]}'] | |
| lbLstRht = [f'{vssvAddr[lpCntr]}'] | |
| else: | |
| lbLstLft.append(f'{vssvAddr[tbPlndrmDim]}') | |
| lbLstRht.append(f'{vssvAddr[lpCntr]}') | |
| tbPlndrmDim-=1 | |
| lpCntr+=1 | |
| if lbLstRht[0] == '0': lbLstRht[0] = '1' | |
| if lpDimCntr+lpDimCntr < len(vssvAddr): plndrmJnOrd = f'{"".join(lbLstRht)}{vssvAddr[lpCntr]}{"".join(lbLstLft)[::-1]}' | |
| else: plndrmJnOrd = f'{"".join(lbLstRht)}{"".join(lbLstLft)[::-1]}' | |
| tetBase = str(tetBase) | |
| lbLstCnd = ''.join(lbLstCnd) | |
| if lbLstCnd == '4224': cxvAddrCnd = 'EVE' | |
| elif lbLstCnd == '535': cxvAddrCnd = 'ODD' | |
| else: | |
| cpnIdSw = True | |
| cxvAddrCnd = 'NET' | |
| return f'1{str(tetBase)}1' | |
| if not cpnIdSw: | |
| lpDimCntr = 0 | |
| for tbChar in tetBase: | |
| cmpChrLen = 0 | |
| for tbCmpCndChar in plndrmJnOrd: | |
| cmpChrLen+=1 | |
| jnLftCnd = int(tbChar) | |
| jnRhtCnd = int(tbCmpCndChar) | |
| if cxvAddrCnd == 'O': | |
| if cmpChrLen < 4: | |
| if (jnLftCnd+jnRhtCnd)/3 > 0: lpDimCntr+=1 | |
| else: | |
| if jnLftCnd > 4: | |
| if jnRhtCnd+2 < jnLftCnd: lpDimCntr-=1 | |
| else: | |
| if jnRhtCnd+3 <= jnLftCnd: lpDimCntr+=1 | |
| else: | |
| if cmpChrLen > 3: | |
| if (jnLftCnd+jnRhtCnd)/3 <= 2: lpDimCntr-=1 | |
| else: lpDimCntr+=1 | |
| else: | |
| if jnLftCnd-jnRhtCnd > 0: lpDimCntr+=1 | |
| else: | |
| if jnRhtCnd > jnLftCnd+1: lpDimCntr-=1 | |
| else: | |
| if (jnRhtCnd+4)/2 > 3: lpDimCntr-=1 | |
| else: lpDimCntr+=1 | |
| lpDimCntr = str(lpDimCntr).replace('0','1') | |
| if lpDimCntr == lpDimCntr[::-1]: | |
| return f'{cxvAddrCnd}:{lpDimCntr[0]}{str(tetBase)}{lpDimCntr[0]}' | |
| else: | |
| if len(lpDimCntr) > 1 and int(lpDimCntr) < 36: | |
| return f'{cxvAddrCnd}:{lpDimCntr[1]}{str(tetBase)}{lpDimCntr[1]}' | |
| else: | |
| return f'{cxvAddrCnd}:{lpDimCntr[0]}{str(tetBase)}{lpDimCntr[0]}' | |
| #_______________________________________________________________________________________ | |
Author
Author
*Not to be confused with YouTube's Unfavorable Semicircles internet event, which was about satellite hacking ICBM(unfavorable semicircles) communications.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
NOTE: Using Base10 to calculate such things is actually called 'unfavorable semi-circles' to real Menorah Mathematics. Where a designated length of pairing is static abbreviated to any multi-looping lengths half-loop.