[{"_1":2,"_170":-5,"_171":-5},"loaderData",{"_3":4,"_94":95,"_169":-5},"root",{"_5":6,"_31":32,"_63":64},"ctx",{"_7":8,"_19":-5,"_20":21,"_22":23,"_24":25,"_26":25,"_27":25,"_28":29,"_30":25},"auth",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5},"sessionClaims","sessionId","sessionStatus","userId","actor","orgId","orgRole","orgSlug","orgPermissions","factorVerificationAge","user","preferencesKeybindings","default","preferencesTheme","light","preferencesFixers",false,"preferencesCopilot","preferencesSelectionAi","notificationCount",0,"flagDenols","ENV",{"_33":34,"_35":36,"_37":38,"_39":40,"_41":42,"_43":44,"_45":46,"_47":48,"_49":50,"_51":52,"_53":54,"_55":56,"_57":58,"_59":60,"_61":62},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","VAL_RUNTIME_NAME","prod","RENDER_GIT_COMMIT","600b9c8bb6560864a5bce9385fbff4cd71ff3bae","RENDER_GIT_BRANCH","main","CLERK_PUBLISHABLE_KEY","pk_live_Y2xlcmsudmFsLnRvd24k","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","API_URL","https://api.val.town","WORKER_FINGERPRINT","963e45ace5b0a45db0aea6fd292ac66b","clerkState",{"_65":66},"__internal_clerk_state",{"_67":68,"_69":42,"_70":71,"_72":71,"_73":25,"_74":71,"_75":71,"_76":71,"_77":71,"_78":71,"_79":71,"_80":71,"_81":71,"_82":83,"_92":25,"_93":25},"__clerk_ssr_state",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5},"__publishableKey","__proxyUrl","","__domain","__isSatellite","__signInUrl","__signUpUrl","__afterSignInUrl","__afterSignUpUrl","__signInForceRedirectUrl","__signUpForceRedirectUrl","__signInFallbackRedirectUrl","__signUpFallbackRedirectUrl","__clerk_debug",{"_84":25,"_85":71,"_86":87,"_88":71,"_89":42,"_90":25,"_91":71},"isSignedIn","proxyUrl","reason","session-token-and-uat-missing","message","publishableKey","isSatellite","domain","__telemetryDisabled","__telemetryDebug","routes/embed.x.$handle.$name.$",{"_96":97,"_98":99,"_100":101,"_102":103,"_148":149,"_166":167,"_168":-5},"handle","bao","name","cipher","path","substitutionCipher.ts","project",{"_104":105,"_98":99,"_106":107,"_108":-5,"_109":110,"_111":112,"_113":-5,"_114":-5,"_12":115,"_116":117,"_118":110,"_119":120,"_121":29,"_14":122,"_123":124,"_125":124,"_126":127,"_128":127,"_129":127,"_130":124,"_131":124,"_19":132,"_135":136,"_147":25},"id","88fab826-2793-11f0-9d52-569c3dd06744","createdAt",["D",1746217506027],"deletedAt","legacyEnvVars",true,"privacy","public","description","imageUrl","a8d58876-68b6-4f0e-8150-985f4e2460c5","pinnedFileId","8901560e-2793-11f0-9d52-569c3dd06744","pinPreview","screenshotVersion",448,"likeCount","6fc68030-e621-49ab-8a1f-a11bb64257a4","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_96":97,"_133":134},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18ycEVlOVBSNmVaOUp0aDdjYlNvajhVRlRtQ08ifQ","branch",{"_137":138,"_98":40,"_104":139,"_140":105,"_141":-5,"_142":-5,"_143":-5,"_144":-5,"_145":99,"_146":97},"version",490,"88faff98-2793-11f0-9d52-569c3dd06744","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectUserId","projectName","userHandle","isOwned","file",{"_104":150,"_98":101,"_151":152,"_153":-5,"_154":139,"_155":156,"_157":110,"_106":158,"_137":29,"_159":160,"_161":162,"_163":25,"_164":-5,"_100":165},"d41a3c9a-4422-11f0-89d5-76b3cceeab13","fileId","d41a3d08-4422-11f0-89d5-76b3cceeab13","parentId","branchId","branchVersion",378,"latest",["D",1749357682642],"fileType","script","content","import { generateHint } from \"./wordHelpers.ts\";\n\nexport function randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}","deleted","label",[101],"permalink","https://www.val.town/x/bao/cipher/code/substitutionCipher.ts","extension","routes/embed","actionData","errors"]