[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_567":568,"_569":570},"routes/_app.x.$handle.$name",{"_97":96,"_32":45,"_105":87,"_27":106,"_13":14,"_107":-5,"_11":108,"_109":110,"_111":112,"_113":114,"_115":116,"_20":-5,"_117":-5,"_118":-5,"_119":25,"_120":121,"_122":49,"_123":-5,"_124":-5,"_125":126},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":-5},"project",{"_43":44,"_32":45,"_38":46,"_47":-5,"_48":49,"_50":51,"_52":51,"_53":-5,"_54":-5,"_18":55,"_56":57,"_58":49,"_59":-5,"_60":61,"_62":63,"_64":65,"_66":-5,"_67":-5,"_68":-5,"_69":-5,"_70":71,"_72":71,"_73":74,"_75":74,"_76":74,"_77":71,"_78":71,"_79":80,"_81":82,"_83":84,"_85":25},"version",535,"changes",[19],"aiChatInfo","userId",{"_20":21,"_22":23,"_24":25,"_26":25,"_27":28,"_29":28},"file",{"_30":31,"_32":28,"_33":34,"_35":37,"_38":39,"_40":14,"_41":42,"_24":25},"previous",{"_30":31,"_32":28,"_33":34,"_35":36},"deleted",false,"deletedHere","path","substitutionCipher.ts","latestPath","fileId","d41a3d08-4422-11f0-89d5-76b3cceeab13","name","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]] = [\n shuffledAlphabet[swapIndex],\n shuffledAlphabet[i],\n ];\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\n .slice(keywordLedSequence.length - positionIndex)\n .concat(\n keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex)\n );\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(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] =\n 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(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] =\n keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionEncode(args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n existingSubstitutionMap?: Record;\n existingReverseSubstitutionMap?: Record;\n misspelledOriginal?: string; // Pre-generated misspelled version for hard mode\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 misspelledOriginal?: string; // Pass through the misspelled version\n} {\n const { plainText, keyword, positionLetter, type, groupingType, existingSubstitutionMap, existingReverseSubstitutionMap, misspelledOriginal } = 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 // If existing maps are provided (for hard mode misspelling), use them\n let substitutionMap: Record;\n let reverseSubstitutionMap: Record;\n \n if (existingSubstitutionMap && existingReverseSubstitutionMap) {\n substitutionMap = existingSubstitutionMap;\n reverseSubstitutionMap = existingReverseSubstitutionMap;\n } else {\n ({ substitutionMap, reverseSubstitutionMap } =\n substitutionAndReverseMaps(keyword, positionLetter, type));\n }\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 // For aristocrat, preserve punctuation and word spacing\n const textWithSpaceAndPunctuation = plainText.toUpperCase();\n encodedGrouped = textWithSpaceAndPunctuation\n .split(\"\")\n .map((char) => {\n // Only encode letters, keep everything else (spaces, punctuation) as-is\n if (/[A-Z]/.test(char)) {\n return substitutionMap[char];\n }\n return char;\n })\n .join(\"\");\n } else if (groupingType === \"patristocrat\") {\n // For patristocrat, strip punctuation and group into 5-letter blocks\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\n .split(\"\")\n .reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {} as Record);\n\n // 4.4 Hint (only give hint if it's patristocrat)\n let hintInfo: { hint: string; source: string };\n if (groupingType === \"aristocrat\") {\n hintInfo = { hint: \"\", source: \"\" };\n } else {\n hintInfo = generateHint(plainText, 4);\n }\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 misspelledOriginal, // Pass through the misspelled version if provided\n };\n}\n","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 // Fix fixed points (no letter should map to itself)\n for (let i = 0; i < alphabet.length; i++) {\n if (alphabet[i] === shuffledAlphabet[i]) {\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [\n shuffledAlphabet[swapIndex],\n shuffledAlphabet[i],\n ];\n }\n }\n\n // Build maps in a separate pass so swaps don't overwrite already-written entries\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n for (let i = 0; i < alphabet.length; i++) {\n substitutionMap[alphabet[i]] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = alphabet[i];\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\n .slice(keywordLedSequence.length - positionIndex)\n .concat(\n keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex)\n );\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(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] =\n 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(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] =\n keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionEncode(args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n existingSubstitutionMap?: Record;\n existingReverseSubstitutionMap?: Record;\n misspelledOriginal?: string; // Pre-generated misspelled version for hard mode\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 misspelledOriginal?: string; // Pass through the misspelled version\n} {\n const { plainText, keyword, positionLetter, type, groupingType, existingSubstitutionMap, existingReverseSubstitutionMap, misspelledOriginal } = 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 // If existing maps are provided (for hard mode misspelling), use them\n let substitutionMap: Record;\n let reverseSubstitutionMap: Record;\n \n if (existingSubstitutionMap && existingReverseSubstitutionMap) {\n substitutionMap = existingSubstitutionMap;\n reverseSubstitutionMap = existingReverseSubstitutionMap;\n } else {\n ({ substitutionMap, reverseSubstitutionMap } =\n substitutionAndReverseMaps(keyword, positionLetter, type));\n }\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 // For aristocrat, preserve punctuation and word spacing\n const textWithSpaceAndPunctuation = plainText.toUpperCase();\n encodedGrouped = textWithSpaceAndPunctuation\n .split(\"\")\n .map((char) => {\n // Only encode letters, keep everything else (spaces, punctuation) as-is\n if (/[A-Z]/.test(char)) {\n return substitutionMap[char];\n }\n return char;\n })\n .join(\"\");\n } else if (groupingType === \"patristocrat\") {\n // For patristocrat, strip punctuation and group into 5-letter blocks\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\n .split(\"\")\n .reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {} as Record);\n\n // 4.4 Hint (only give hint if it's patristocrat)\n let hintInfo: { hint: string; source: string };\n if (groupingType === \"aristocrat\") {\n hintInfo = { hint: \"\", source: \"\" };\n } else {\n hintInfo = generateHint(plainText, 4);\n }\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 misspelledOriginal, // Pass through the misspelled version if provided\n };\n}\n","createdAt",["D",1774143132812],"branchVersion","branchId","88faff98-2793-11f0-9d52-569c3dd06744","id","88fab826-2793-11f0-9d52-569c3dd06744","cipher",["D",1746217506027],"deletedAt","legacyEnvVars",true,"privacy","public","httpPrivacy","description","imageUrl","a8d58876-68b6-4f0e-8150-985f4e2460c5","pinnedFileId","8901560e-2793-11f0-9d52-569c3dd06744","pinPreview","pinMigrated","screenshotVersion",448,"likeCount",0,"orgId","6fc68030-e621-49ab-8a1f-a11bb64257a4","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_97":96,"_104":100},"org",{"_97":96,"_98":-5,"_99":100,"_18":55,"_101":102,"_103":25},"branch",{"_13":86,"_32":87,"_43":42,"_88":44,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":-5,"_94":45,"_95":96},"isOwned",541,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","bao","handle","displayName","avatar","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18ycEVlOVBSNmVaOUp0aDdjYlNvajhVRlRtQ08ifQ","tier","free","canRestrictVals","profileImageUrl","branchName","","adoptOrgId",{"_43":44,"_32":45,"_38":563,"_47":-5,"_48":49,"_50":51,"_52":51,"_53":-5,"_54":-5,"_18":55,"_56":57,"_58":49,"_59":-5,"_60":61,"_62":63,"_64":65,"_66":-5,"_67":-5,"_68":-5,"_69":-5,"_70":71,"_72":71,"_73":74,"_75":74,"_76":74,"_77":71,"_78":71,"_79":564,"_81":565,"_83":566,"_85":25},"tree",[410,412,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445],"files",[410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445],"counts",{"_400":63,"_401":168,"_402":63,"_403":404,"_405":406},"contents",[127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_43":394,"_32":395,"_30":396,"_164":-5,"_41":42,"_40":397,"_166":49,"_38":398,"_13":63,"_33":392,"_35":-5,"_24":25,"_170":-5,"_27":399},{"_43":388,"_32":389,"_30":390,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":391,"_13":63,"_33":392,"_35":-5,"_24":25,"_170":-5,"_27":393},{"_43":382,"_32":383,"_30":384,"_164":-5,"_41":42,"_40":301,"_166":49,"_38":385,"_13":225,"_33":20,"_35":386,"_24":25,"_170":-5,"_27":387},{"_43":376,"_32":377,"_30":378,"_164":-5,"_41":42,"_40":328,"_166":25,"_38":379,"_13":295,"_33":34,"_35":380,"_24":25,"_170":-5,"_27":381},{"_43":369,"_32":370,"_30":371,"_164":-5,"_41":42,"_40":372,"_166":49,"_38":373,"_13":63,"_33":34,"_35":374,"_24":25,"_170":-5,"_27":375},{"_43":361,"_32":362,"_30":363,"_164":-5,"_41":42,"_40":364,"_166":25,"_38":365,"_13":366,"_33":34,"_35":367,"_24":25,"_170":-5,"_27":368},{"_43":355,"_32":356,"_30":357,"_164":-5,"_41":42,"_40":320,"_166":49,"_38":358,"_13":210,"_33":34,"_35":359,"_24":25,"_170":-5,"_27":360},{"_43":347,"_32":348,"_30":349,"_164":-5,"_41":42,"_40":350,"_166":49,"_38":351,"_13":352,"_33":34,"_35":353,"_24":25,"_170":-5,"_27":354},{"_43":340,"_32":341,"_30":342,"_164":-5,"_41":42,"_40":343,"_166":49,"_38":344,"_13":210,"_33":34,"_35":345,"_24":25,"_170":-5,"_27":346},{"_43":333,"_32":334,"_30":335,"_164":-5,"_41":42,"_40":336,"_166":49,"_38":337,"_13":202,"_33":34,"_35":338,"_24":25,"_170":-5,"_27":339},{"_43":325,"_32":326,"_30":327,"_164":-5,"_41":42,"_40":328,"_166":49,"_38":329,"_13":330,"_33":34,"_35":331,"_24":25,"_170":-5,"_27":332},{"_43":317,"_32":318,"_30":319,"_164":-5,"_41":42,"_40":320,"_166":49,"_38":321,"_13":322,"_33":34,"_35":323,"_24":25,"_170":-5,"_27":324},{"_43":311,"_32":312,"_30":313,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":314,"_13":63,"_33":20,"_35":315,"_24":25,"_170":-5,"_27":316},{"_43":305,"_32":306,"_30":307,"_164":-5,"_41":42,"_40":210,"_166":49,"_38":308,"_13":63,"_33":20,"_35":309,"_24":25,"_170":-5,"_27":310},{"_43":298,"_32":299,"_30":300,"_164":-5,"_41":42,"_40":301,"_166":49,"_38":302,"_13":63,"_33":34,"_35":303,"_24":25,"_170":-5,"_27":304},{"_43":290,"_32":291,"_30":292,"_164":-5,"_41":42,"_40":293,"_166":49,"_38":294,"_13":295,"_33":34,"_35":296,"_24":25,"_170":-5,"_27":297},{"_43":284,"_32":285,"_30":286,"_164":-5,"_41":42,"_40":246,"_166":49,"_38":287,"_13":210,"_33":34,"_35":288,"_24":25,"_170":-5,"_27":289},{"_43":278,"_32":279,"_30":280,"_164":-5,"_41":42,"_40":193,"_166":49,"_38":281,"_13":210,"_33":34,"_35":282,"_24":25,"_170":-5,"_27":283},{"_43":271,"_32":272,"_30":273,"_164":-5,"_41":42,"_40":274,"_166":49,"_38":275,"_13":210,"_33":34,"_35":276,"_24":25,"_170":-5,"_27":277},{"_43":263,"_32":264,"_30":265,"_164":-5,"_41":42,"_40":266,"_166":25,"_38":267,"_13":268,"_33":34,"_35":269,"_24":25,"_170":-5,"_27":270},{"_43":256,"_32":257,"_30":258,"_164":-5,"_41":42,"_40":259,"_166":25,"_38":260,"_13":63,"_33":34,"_35":261,"_24":25,"_170":-5,"_27":262},{"_43":250,"_32":251,"_30":252,"_164":-5,"_41":42,"_40":200,"_166":49,"_38":253,"_13":210,"_33":34,"_35":254,"_24":25,"_170":-5,"_27":255},{"_43":243,"_32":244,"_30":245,"_164":-5,"_41":42,"_40":246,"_166":49,"_38":247,"_13":63,"_33":34,"_35":248,"_24":25,"_170":-5,"_27":249},{"_43":234,"_32":235,"_30":57,"_164":-5,"_41":42,"_40":236,"_166":49,"_38":237,"_13":238,"_33":239,"_35":240,"_24":25,"_170":241,"_27":242},{"_43":228,"_32":229,"_30":230,"_164":-5,"_41":42,"_40":165,"_166":49,"_38":231,"_13":202,"_33":34,"_35":232,"_24":25,"_170":-5,"_27":233},{"_43":220,"_32":221,"_30":222,"_164":-5,"_41":42,"_40":223,"_166":49,"_38":224,"_13":225,"_33":34,"_35":226,"_24":25,"_170":-5,"_27":227},{"_43":213,"_32":214,"_30":215,"_164":-5,"_41":42,"_40":216,"_166":49,"_38":217,"_13":63,"_33":34,"_35":218,"_24":25,"_170":-5,"_27":219},{"_43":205,"_32":206,"_30":207,"_164":-5,"_41":42,"_40":208,"_166":49,"_38":209,"_13":210,"_33":34,"_35":211,"_24":25,"_170":-5,"_27":212},{"_43":197,"_32":198,"_30":199,"_164":-5,"_41":42,"_40":200,"_166":49,"_38":201,"_13":202,"_33":34,"_35":203,"_24":25,"_170":-5,"_27":204},{"_43":190,"_32":191,"_30":192,"_164":-5,"_41":42,"_40":193,"_166":49,"_38":194,"_13":63,"_33":20,"_35":195,"_24":25,"_170":-5,"_27":196},{"_43":183,"_32":184,"_30":185,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":187,"_13":63,"_33":34,"_35":188,"_24":25,"_170":-5,"_27":189},{"_43":179,"_32":28,"_30":31,"_164":-5,"_41":42,"_40":14,"_166":49,"_38":180,"_13":181,"_33":34,"_35":37,"_24":25,"_170":-5,"_27":182},{"_43":172,"_32":173,"_30":174,"_164":-5,"_41":42,"_40":175,"_166":49,"_38":176,"_13":63,"_33":34,"_35":177,"_24":25,"_170":-5,"_27":178},{"_43":161,"_32":162,"_30":163,"_164":-5,"_41":42,"_40":165,"_166":49,"_38":167,"_13":168,"_33":34,"_35":169,"_24":25,"_170":-5,"_27":171},"393bc5e2-c24c-11f0-9bca-42dde27851f2","wordHelpers.ts","d41a43f2-4422-11f0-89d5-76b3cceeab13","parentId",521,"latest",["D",1763229308190],2,"export function getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nexport function randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nexport function randomWordFromSentence(sentence: string): string {\n const words = sentence.split(\" \");\n for (let i = 0; i < words.length * 2; i++) {\n const word = words[Math.floor(Math.random() * words.length)];\n const alphabetsOnly = word.replace(/[^A-Za-z]/g, \"\");\n if (alphabetsOnly.length >= 4) {\n return alphabetsOnly.toUpperCase();\n }\n }\n return \"\";\n}\n\nexport function generateHint(\n quote: string,\n letterCount: number = 4\n): { hint: string; source: \"first\" | \"last\" } {\n const words = quote.split(\" \");\n let currentHint = \"\";\n let hintWithSpaceRemoved = \"\";\n let quoteWithLettersOnly = quote.replace(/[^A-Za-z]/g, \"\");\n\n const source = quote.length % 2 === 1 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have the specified number of letters\n for (let i = 0; i < quoteWithLettersOnly.length; i++) {\n currentHint += quoteWithLettersOnly[i];\n hintWithSpaceRemoved = currentHint.replace(/\\s/g, \"\");\n\n if (hintWithSpaceRemoved.length === letterCount) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find the specified number of letters, return the first word\n return {\n hint: words[0],\n source: \"first\",\n };\n } else {\n // Iterate through words in reverse, building the hint until we have the specified number of letters\n for (let i = quoteWithLettersOnly.length - 1; i >= 0; i--) {\n currentHint = quoteWithLettersOnly[i] + currentHint;\n hintWithSpaceRemoved = currentHint.replace(/\\s/g, \"\");\n\n if (hintWithSpaceRemoved.length === letterCount) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find the specified number of letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n","label",[162],"f61dc908-c03a-11f0-b555-42dde27851f2","test_misspell.ts","f61dc9c6-c03a-11f0-b555-42dde27851f2",517,["D",1763001991791],"import { misspellSentence } from \"./misspellHelpers.ts\";\n\n// Test sentences with common words that have misspelling alternatives\nconst testSentences = [\n \"The only way to do great work is to love what you do.\",\n \"I think that you should always know what you want in life.\",\n \"When you have nothing, you must make something from your heart.\",\n \"People will never understand the truth about this world.\",\n \"Your time is limited, so don't waste it living someone else's life.\",\n \"The best time to plant a tree was 20 years ago. The second best time is now.\",\n \"Success is not final, failure is not fatal: it is the courage to continue that counts.\",\n \"Be yourself; everyone else is already taken.\",\n \"In the end, we will remember not the words of our enemies, but the silence of our friends.\",\n \"Life is what happens when you're busy making other plans.\"\n];\n\nconsole.log(\"=== Testing Misspell Function ===\\n\");\nconsole.log(\"Running misspellSentence with 33% chance per word\\n\");\nconsole.log(\"━\".repeat(80));\n\ntestSentences.forEach((sentence, index) => {\n console.log(`\\n${index + 1}. ORIGINAL:`);\n console.log(` ${sentence}`);\n \n // Run misspelling 3 times to show variation\n console.log(`\\n MISSPELLED VERSIONS:`);\n for (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(sentence);\n console.log(` ${i}. ${misspelled}`);\n }\n \n console.log(\"\\n\" + \"━\".repeat(80));\n});\n\nconsole.log(\"\\n=== Testing with Higher Misspelling Rate (66%) ===\\n\");\n\nconst highRateSentence = \"I think you should know that your life will be better when you make the right choices.\";\nconsole.log(\"ORIGINAL:\");\nconsole.log(`${highRateSentence}\\n`);\nconsole.log(\"MISSPELLED (66% chance):\");\nfor (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(highRateSentence, 66);\n console.log(`${i}. ${misspelled}`);\n}\n\nconsole.log(\"\\n=== Testing with Lower Misspelling Rate (15%) ===\\n\");\n\nconst lowRateSentence = \"I think you should know that your life will be better when you make the right choices.\";\nconsole.log(\"ORIGINAL:\");\nconsole.log(`${lowRateSentence}\\n`);\nconsole.log(\"MISSPELLED (15% chance):\");\nfor (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(lowRateSentence, 15);\n console.log(`${i}. ${misspelled}`);\n}\n\n",[173],"f3a46a88-258e-11f1-90a8-42dde27851f2",["D",1774143132812],6,[28],"2975aee6-a6e7-11f0-a077-0224a6c84d84","substitutionCipher.test.ts","2975af68-a6e7-11f0-a077-0224a6c84d84",496,["D",1760217221145],"import {\n assertEquals,\n assertMatch,\n} from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport {\n substitutionEncode,\n substitutionAndReverseMaps,\n} from \"./substitutionCipher.ts\";\n\nDeno.test(\"Aristocrat - preserves punctuation and spacing\", () => {\n const plainText = \"Hello, World! How are you?\";\n const keyword = \"SECRET\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify punctuation is preserved\n assertEquals(result.encoded.includes(\",\"), true, \"Comma should be preserved\");\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation mark should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"?\"),\n true,\n \"Question mark should be preserved\"\n );\n\n // Verify spaces are preserved in the same positions\n const originalSpaces = [...plainText]\n .map((c, i) => (c === \" \" ? i : -1))\n .filter((i) => i >= 0);\n const encodedSpaces = [...result.encoded]\n .map((c, i) => (c === \" \" ? i : -1))\n .filter((i) => i >= 0);\n assertEquals(\n encodedSpaces,\n originalSpaces,\n \"Spaces should be in the same positions\"\n );\n\n // Verify only letters are encoded\n const encodedWithoutSpaces = result.encoded.replace(/\\s/g, \"\");\n const plainTextWithoutSpaces = plainText.toUpperCase().replace(/\\s/g, \"\");\n\n for (let i = 0; i < encodedWithoutSpaces.length; i++) {\n const encodedChar = encodedWithoutSpaces[i];\n const plainChar = plainTextWithoutSpaces[i];\n\n if (/[A-Z]/.test(plainChar)) {\n // Letter should be encoded\n assertEquals(\n /[A-Z]/.test(encodedChar),\n true,\n `Encoded letter ${encodedChar} should be A-Z`\n );\n } else {\n // Punctuation should remain unchanged\n assertEquals(\n encodedChar,\n plainChar,\n `Punctuation ${plainChar} should be preserved`\n );\n }\n }\n\n // Verify encoded length matches original length\n assertEquals(\n result.encoded.length,\n plainText.length,\n \"Encoded text should have same length as original\"\n );\n});\n\nDeno.test(\"Aristocrat - letters are properly substituted\", () => {\n const plainText = \"Don't worry!\";\n const keyword = \"KEYWORD\";\n const positionLetter = \"B\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Extract only letters from encoded and original\n const encodedLetters = result.encoded.replace(/[^A-Z]/g, \"\");\n const originalLetters = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // Verify each letter is properly encoded using the substitution map\n for (let i = 0; i < originalLetters.length; i++) {\n const originalLetter = originalLetters[i];\n const expectedEncoded = result.substitutionMap[originalLetter];\n const actualEncoded = encodedLetters[i];\n assertEquals(\n actualEncoded,\n expectedEncoded,\n `Letter ${originalLetter} should encode to ${expectedEncoded}, got ${actualEncoded}`\n );\n }\n\n // Verify apostrophe and exclamation are preserved\n assertEquals(\n result.encoded.includes(\"'\"),\n true,\n \"Apostrophe should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n});\n\nDeno.test(\n \"Patristocrat - strips punctuation and groups into 5-letter blocks\",\n () => {\n const plainText = \"Hello, World! How are you?\";\n const keyword = \"SECRET\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"patristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify no punctuation in encoded text\n assertEquals(\n /[^A-Z\\s]/.test(result.encoded),\n false,\n \"Should not contain any punctuation\"\n );\n\n // Verify letters are grouped into 5-letter blocks\n const groups = result.encoded.split(\" \");\n\n // All groups except possibly the last should have 5 letters\n for (let i = 0; i < groups.length - 1; i++) {\n assertEquals(groups[i].length, 5, `Group ${i} should have 5 letters`);\n }\n\n // Last group should have 1-5 letters\n const lastGroup = groups[groups.length - 1];\n assertEquals(\n lastGroup.length >= 1 && lastGroup.length <= 5,\n true,\n \"Last group should have between 1 and 5 letters\"\n );\n\n // Verify all encoded characters are uppercase letters\n const encodedWithoutSpaces = result.encoded.replace(/\\s/g, \"\");\n assertEquals(\n /^[A-Z]+$/.test(encodedWithoutSpaces),\n true,\n \"All characters (except spaces) should be uppercase letters\"\n );\n }\n);\n\nDeno.test(\n \"Patristocrat - same substitution as aristocrat but different formatting\",\n () => {\n const plainText = \"Test message!\";\n const keyword = \"KEY\";\n const positionLetter = \"C\";\n const type = \"k2\";\n\n const aristocrat = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType: \"aristocrat\",\n });\n\n const patristocrat = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType: \"patristocrat\",\n });\n\n // Both should use the same substitution map\n assertEquals(\n aristocrat.substitutionMap,\n patristocrat.substitutionMap,\n \"Both should use same substitution map\"\n );\n\n // Extract letters only from both\n const aristocratLetters = aristocrat.encoded.replace(/[^A-Z]/g, \"\");\n const patristocratLetters = patristocrat.encoded.replace(/[^A-Z]/g, \"\");\n\n // Same letters, same encoding\n assertEquals(\n aristocratLetters,\n patristocratLetters,\n \"Same letters should be encoded identically\"\n );\n\n // But different formatting\n assertEquals(\n aristocrat.encoded === patristocrat.encoded,\n false,\n \"Formatting should be different\"\n );\n }\n);\n\nDeno.test(\n \"Caesar cipher (K1 with empty keyword) - aristocrat preserves punctuation\",\n () => {\n const plainText = \"Hello, Caesar!\";\n const keyword = \"\";\n const positionLetter = \"D\"; // Shift of 3\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify it's a Caesar cipher (shift cipher)\n const { substitutionMap } = result;\n\n // For Caesar with shift 3 (D), A->D, B->E, C->F, etc.\n assertEquals(substitutionMap[\"A\"], \"D\", \"A should map to D\");\n assertEquals(substitutionMap[\"B\"], \"E\", \"B should map to E\");\n assertEquals(substitutionMap[\"C\"], \"F\", \"C should map to F\");\n\n // Verify punctuation is preserved\n assertEquals(\n result.encoded.includes(\",\"),\n true,\n \"Comma should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n\n // Verify the encoding\n assertEquals(result.encoded.charAt(0), \"K\", \"H (pos 7) + 3 = K (pos 10)\");\n assertEquals(result.encoded.includes(\",\"), true, \"Should have comma\");\n assertEquals(result.encoded.includes(\"!\"), true, \"Should have exclamation\");\n }\n);\n\nDeno.test(\"Letter counts - should only count letters, not punctuation\", () => {\n const plainText = \"A, A, A! B, B!\";\n const keyword = \"TEST\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Count how many times 'A' and 'B' appear in original\n const aCount = (plainText.match(/A/gi) || []).length;\n const bCount = (plainText.match(/B/gi) || []).length;\n\n // Get encoded letters for A and B\n const encodedA = result.substitutionMap[\"A\"];\n const encodedB = result.substitutionMap[\"B\"];\n\n // Verify counts match\n assertEquals(\n result.encodedLetterCounts[encodedA],\n aCount,\n `Encoded letter for A should appear ${aCount} times`\n );\n assertEquals(\n result.encodedLetterCounts[encodedB],\n bCount,\n `Encoded letter for B should appear ${bCount} times`\n );\n\n // Verify punctuation doesn't appear in counts\n assertEquals(\n result.encodedLetterCounts[\",\"],\n undefined,\n \"Comma should not be in letter counts\"\n );\n assertEquals(\n result.encodedLetterCounts[\"!\"],\n undefined,\n \"Exclamation should not be in letter counts\"\n );\n});\n\nDeno.test(\"cleanOriginal - should only contain letters\", () => {\n const plainText = \"Hello, World! 123\";\n const keyword = \"KEY\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // cleanOriginal should be letters only, no punctuation or numbers\n assertEquals(\n /^[A-Z]+$/.test(result.cleanOriginal),\n true,\n \"cleanOriginal should only contain uppercase letters\"\n );\n assertEquals(\n result.cleanOriginal,\n \"HELLOWORLD\",\n \"cleanOriginal should be HELLOWORLD\"\n );\n});\n\nDeno.test(\"Various punctuation marks - aristocrat\", () => {\n const plainText = \"One-two-three... Go! (Now)\";\n const keyword = \"WORD\";\n const positionLetter = \"A\";\n const type = \"k2\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify all punctuation is preserved\n assertEquals(\n result.encoded.includes(\"-\"),\n true,\n \"Hyphen should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\".\"),\n true,\n \"Period should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"(\"),\n true,\n \"Opening parenthesis should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\")\"),\n true,\n \"Closing parenthesis should be preserved\"\n );\n\n // Count punctuation marks\n const originalPunctCount = (plainText.match(/[^A-Za-z\\s]/g) || []).length;\n const encodedPunctCount = (result.encoded.match(/[^A-Z\\s]/g) || []).length;\n assertEquals(\n encodedPunctCount,\n originalPunctCount,\n \"Number of punctuation marks should be preserved\"\n );\n});\n",[184],"229d604e-a798-11f0-8271-0224a6c84d84","run_tests.sh","229d60d0-a798-11f0-8271-0224a6c84d84",506,["D",1760293230598],"#!/bin/bash\n\n# Script to run all unit tests in the cipher project\n\necho \"Running all unit tests...\"\necho \"========================\"\necho \"\"\n\n# Find all .test.ts files and run them\ndeno test --allow-net --no-check *.test.ts\n\necho \"\"\necho \"========================\"\necho \"Tests completed!\"\n\n",[191],"c7db17c0-e3b8-11f0-9c20-42dde27851f2","quoteService.ts","229d5644-a798-11f0-8271-0224a6c84d84",525,["D",1766904321471],4,"import { getKnownTexts } from \"./gameHelpers.ts\";\nimport { post } from \"./networkHelpers.ts\";\nimport { randomLetter } from \"./wordHelpers.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\n\nexport interface FetchQuoteResult {\n cipher: ReturnType | null;\n author: string | null;\n knownTexts: string[];\n error: string | null;\n}\n\nexport async function fetchQuote(uuid: string): Promise {\n try {\n const known = await getKnownTexts();\n\n let loadedFromUUID = false;\n let cipher: ReturnType | null = null;\n let author: string | null = null;\n\n if (uuid) {\n let value: any = undefined;\n while (value === undefined) {\n const response = await fetch(\n `https://simplevalueapi.val.run/getValue?id=${uuid}`\n );\n const responseData = await response.json();\n if (responseData?.error) {\n break;\n }\n value = responseData?.value;\n if (!value) {\n await new Promise((resolve) => setTimeout(resolve, 500));\n }\n }\n const newCipher = value?.cipher;\n const fetchedAuthor = value?.author;\n if (newCipher && fetchedAuthor) {\n cipher = newCipher;\n author = fetchedAuthor;\n loadedFromUUID = true;\n }\n }\n\n if (!loadedFromUUID) {\n if (uuid) {\n // mark this uuid as known\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n });\n }\n let quote = \"\";\n let fetchedAuthor = \"\";\n let responseKeyword = \"\";\n while (quote === \"\") {\n const response = await fetch(`/quote`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 5) {\n responseKeyword = responseData.keyword;\n quote = responseData.quote;\n fetchedAuthor = responseData.author;\n break;\n }\n }\n\n // Cipher type randomization logic:\n // We have 6 total cipher types, each with equal 1/6 probability:\n // - Aristocrat (66%): k1 (16.67%), k1-caesar (16.67%), k2 (16.67%), random (16.67%)\n // - Patristocrat (33%): k1 (16.67%), k2 (16.67%)\n const groupingType =\n Math.random() < 2 / 3 ? \"aristocrat\" : \"patristocrat\";\n const typeRandom = Math.random();\n const type =\n groupingType === \"aristocrat\"\n ? typeRandom < 0.5\n ? \"k1\"\n : typeRandom < 0.75\n ? \"k2\"\n : \"random\"\n : typeRandom < 0.5\n ? \"k1\"\n : \"k2\";\n\n // For k1 aristocrat, 50% chance of empty keyword (Caesar cipher)\n const isCaesar =\n type === \"k1\" && groupingType === \"aristocrat\" && Math.random() < 0.5;\n const keyword = isCaesar ? \"\" : responseKeyword;\n\n // Always create cipher with the original quote\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({\n plainText: quote,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n \n // Pre-generate misspelled version for aristocrat (for hard mode consistency)\n let misspelledOriginal: string | undefined;\n if (groupingType === \"aristocrat\") {\n misspelledOriginal = misspellSentence(quote);\n newCipher.misspelledOriginal = misspelledOriginal;\n }\n \n cipher = newCipher;\n author = fetchedAuthor;\n if (uuid) {\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n value: { cipher: newCipher, author: fetchedAuthor },\n });\n }\n }\n\n return {\n cipher,\n author,\n knownTexts: known,\n error: null,\n };\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n return {\n cipher: null,\n author: null,\n knownTexts: [],\n error: `${error}`,\n };\n }\n}\n",[198],"df182b86-b743-11f0-a388-0224a6c84d84","quoteService.test.ts","229d49ce-a798-11f0-8271-0224a6c84d84",511,["D",1762016258186],1,"import {\n assertEquals,\n assert,\n} from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { fetchQuote } from \"./quoteService.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { post } from \"./networkHelpers.ts\";\n\n/**\n * Helper to create a test game that won't expire during testing\n * Returns null if creation fails (e.g., network issues)\n */\nasync function createTestGame(): Promise {\n try {\n const testUuid = `cipher-test-${Date.now()}`;\n const testCipher = substitutionEncode({\n plainText: \"This is a test quote for testing.\",\n keyword: \"TEST\",\n positionLetter: \"A\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n });\n\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: testUuid,\n value: { cipher: testCipher, author: \"Test Author\" },\n });\n\n // Give the API a moment to save\n await new Promise((resolve) => setTimeout(resolve, 500));\n\n return testUuid;\n } catch (error) {\n console.error(\"Failed to create test game:\", error);\n return null;\n }\n}\n\nDeno.test({\n name: \"fetchQuote - loads existing game from UUID\",\n async fn() {\n // Create a fresh test game\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return; // Skip test if we can't create a test game\n }\n\n const result = await fetchQuote(testUuid);\n\n // Should successfully load the game\n assertEquals(result.error, null, \"Should not have an error\");\n assert(result.cipher !== null, \"Should have a cipher\");\n assertEquals(\n result.author,\n \"Test Author\",\n \"Should have the correct author\"\n );\n assert(Array.isArray(result.knownTexts), \"Should have known texts array\");\n },\n sanitizeResources: false, // Network requests may leave resources open\n});\n\nDeno.test(\n \"fetchQuote - handles non-existent UUID (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires the /quote endpoint which only works in browser context\n // Skip for now - could be implemented with a mock server\n }\n);\n\nDeno.test({\n name: \"fetchQuote - cipher has required properties\",\n async fn() {\n // Create a fresh test game\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return;\n }\n\n const result = await fetchQuote(testUuid);\n\n assert(result.cipher !== null, \"Should have a cipher\");\n\n if (result.cipher) {\n // Check all required properties exist\n assert(\n typeof result.cipher.encoded === \"string\",\n \"encoded should be a string\"\n );\n assert(\n typeof result.cipher.original === \"string\",\n \"original should be a string\"\n );\n assert(\n typeof result.cipher.cleanOriginal === \"string\",\n \"cleanOriginal should be a string\"\n );\n assert(\n typeof result.cipher.keyword === \"string\",\n \"keyword should be a string\"\n );\n assert(\n typeof result.cipher.positionLetter === \"string\",\n \"positionLetter should be a string\"\n );\n assert(\n [\"k1\", \"k2\", \"random\"].includes(result.cipher.type),\n \"type should be k1, k2, or random\"\n );\n assert(\n [\"aristocrat\", \"patristocrat\"].includes(result.cipher.groupingType),\n \"groupingType should be aristocrat or patristocrat\"\n );\n assert(\n typeof result.cipher.substitutionMap === \"object\",\n \"should have substitutionMap\"\n );\n assert(\n typeof result.cipher.reverseSubstitutionMap === \"object\",\n \"should have reverseSubstitutionMap\"\n );\n }\n },\n sanitizeResources: false, // Network requests may leave resources open\n});\n\nDeno.test(\n \"fetchQuote - aristocrat preserves punctuation (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires creating new games which needs /quote endpoint\n // Punctuation preservation is tested in substitutionCipher.test.ts\n }\n);\n\nDeno.test(\n \"fetchQuote - patristocrat strips punctuation (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires creating new games which needs /quote endpoint\n // Punctuation stripping is tested in substitutionCipher.test.ts\n }\n);\n\nDeno.test(\n \"fetchQuote - handles empty UUID (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires /quote endpoint\n // Could be implemented with a mock server\n }\n);\n\nDeno.test({\n name: \"fetchQuote - gracefully handles errors\",\n async fn() {\n // Test with a UUID that definitely doesn't exist\n const nonExistentUuid = `cipher-nonexistent-${Date.now()}`;\n const result = await fetchQuote(nonExistentUuid);\n\n // Should have knownTexts array regardless\n assert(\n Array.isArray(result.knownTexts),\n \"Should always return knownTexts array\"\n );\n\n // When UUID doesn't exist in Deno context without /quote endpoint,\n // it should return an error\n // In browser context with /quote endpoint, it would create a new game\n },\n sanitizeResources: false, // /quote endpoint causes resource leak in test environment\n});\n\nDeno.test({\n name: \"fetchQuote - always returns knownTexts array\",\n async fn() {\n // Create a valid test game to ensure we get a proper response\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return;\n }\n\n const result = await fetchQuote(testUuid);\n\n // Should always return a knownTexts array\n assert(Array.isArray(result.knownTexts), \"knownTexts should be an array\");\n },\n sanitizeResources: false,\n});\n",[206],"241abd8a-44b1-11f0-a3f3-76b3cceeab13","networkHelpers.ts","241abe2a-44b1-11f0-a3f3-76b3cceeab13",383,["D",1749418805397],"export async function post(url: string, data: any) {\n return await fetch(url, {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify(data),\n });\n}",[214],"eeeea684-4fbf-11f0-9f08-f69ea79377d9","nativeToWeb.ts","9afed40a-4fbe-11f0-bcd3-f69ea79377d9",472,["D",1750634621433],3,"import { startNewGame } from \"./gameHelpers.ts\";\n\nexport function setupNativeToWebHandlers({ uuid }: { uuid: string }) {\n if (window.WebNativeBridge) {\n window.WebNativeBridge.nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n } else if (data.action === \"alive\") {\n return { result: true };\n }\n };\n }\n}",[221],"393bae18-c24c-11f0-9bca-42dde27851f2","misspellHelpers.ts","ca1e62ec-bf93-11f0-8a96-42dde27851f2",["D",1763229308190],"/**\n * Map of common words to their misspelled/homophone alternatives.\n * These words are ALWAYS misspelled when encountered.\n */\nconst REPLACEMENT_MAP: Record = {\n that: [\"tht\", \"dat\", \"taht\", \"sat\"],\n your: [\"ur\", \"yor\", \"yer\", \"you're\"],\n have: [\"hav\", \"hve\", \"haf\", \"half\"],\n with: [\"wth\", \"weeth\", \"wit\", \"wiz\"],\n what: [\"wat\", \"wht\", \"wut\", \"whut\"],\n will: [\"wil\", \"whil\", \"whill\", \"wheel\"],\n when: [\"wen\", \"whn\", \"wren\", \"whe\"],\n they: [\"thay\", \"thy\", \"dey\", \"thei\"],\n there: [\"their\", \"ther\", \"thier\", \"der\"],\n life: [\"lyfe\", \"lif\", \"lfe\", \"lief\"],\n people: [\"ppl\", \"peple\", \"peepl\", \"peeple\"],\n than: [\"then\", \"thn\", \"dan\", \"thang\"],\n only: [\"onli\", \"onle\", \"onley\", \"ownly\"],\n love: [\"luv\", \"lov\", \"luve\", \"lav\"],\n from: [\"frm\", \"frum\", \"fom\", \"frorm\"],\n world: [\"wrld\", \"wurld\", \"worl\", \"werld\"],\n which: [\"wich\", \"whch\", \"witch\", \"wic\"],\n more: [\"mor\", \"moar\", \"moor\", \"mre\"],\n like: [\"lyk\", \"lighk\", \"lyke\", \"lke\"],\n them: [\"thm\", \"dem\", \"thum\", \"tham\"],\n never: [\"nevr\", \"neva\", \"nver\", \"nevar\"],\n things: [\"thngs\", \"thingz\", \"thangs\", \"tings\"],\n good: [\"gud\", \"gd\", \"goo\", \"guud\"],\n know: [\"no\", \"kno\", \"noe\", \"knw\"],\n this: [\"dis\", \"ths\", \"tis\", \"thiss\"],\n must: [\"mst\", \"mus\", \"musst\", \"muhst\"],\n time: [\"tym\", \"tyme\", \"tim\", \"thyme\"],\n make: [\"mak\", \"maek\", \"mek\", \"mke\"],\n without: [\"w/o\", \"withut\", \"witout\", \"wthout\"],\n always: [\"alwys\", \"alwayz\", \"allways\", \"awlays\"],\n their: [\"there\", \"thier\", \"thir\", \"der\"],\n nothing: [\"nuthing\", \"nothin\", \"nothng\", \"nuting\"],\n because: [\"becuz\", \"becaus\", \"bcuz\", \"cuz\"],\n every: [\"evry\", \"evrey\", \"evory\", \"evri\"],\n should: [\"shud\", \"shuld\", \"shoud\", \"shld\"],\n live: [\"liv\", \"lyve\", \"lve\", \"lief\"],\n yourself: [\"urself\", \"yorself\", \"yurself\", \"youself\"],\n does: [\"dus\", \"doez\", \"duz\", \"dose\"],\n something: [\"somethin\", \"sumthing\", \"somthing\", \"somethn\"],\n think: [\"thnk\", \"thynk\", \"tink\", \"thik\"],\n others: [\"othrs\", \"otherz\", \"othes\", \"uthers\"],\n about: [\"bout\", \"abowt\", \"abt\", \"abut\"],\n most: [\"mst\", \"moast\", \"mosst\", \"mos\"],\n those: [\"thos\", \"thoes\", \"doze\", \"dose\"],\n then: [\"than\", \"thn\", \"den\", \"thun\"],\n mind: [\"mynd\", \"mnd\", \"mined\", \"mihnd\"],\n cannot: [\"cant\", \"canot\", \"cannt\", \"kant\"],\n would: [\"wud\", \"wuld\", \"wood\", \"wude\"],\n want: [\"wnt\", \"wont\", \"wount\", \"waunt\"],\n just: [\"dgust\", \"jus\", \"jost\", \"jast\"],\n other: [\"ozzer\", \"uther\", \"othur\", \"odder\"],\n into: [\"intwo\", \"intoo\", \"intu\", \"innto\"],\n thing: [\"think\", \"thin\", \"ting\", \"thang\"],\n great: [\"grate\", \"greit\", \"gret\", \"graet\"],\n being: [\"bein\", \"beeing\", \"bean\", \"beying\"],\n person: [\"peson\", \"persun\", \"persen\", \"pearson\"],\n heart: [\"hart\", \"hrt\", \"herat\", \"hort\"],\n even: [\"eeven\", \"evan\", \"evin\", \"evun\"],\n find: [\"faind\", \"fynd\", \"fined\", \"fiend\"],\n right: [\"rite\", \"ryght\", \"wright\", \"rigt\"],\n better: [\"beter\", \"bettr\", \"bettar\", \"bettor\"],\n become: [\"beecome\", \"becom\", \"bekome\", \"becalm\"],\n were: [\"where\", \"wer\", \"ware\", \"wure\"],\n some: [\"sum\", \"som\", \"son\", \"song\"],\n truth: [\"tooth\", \"troof\", \"trueth\", \"truce\"],\n knowledge: [\"knowlege\", \"knolege\", \"nowledge\", \"noledge\"],\n};\n\n/**\n * Introduces misspellings into a sentence by randomly misspelling words.\n * Strategy:\n * 1. First pass: Replace all words in REPLACEMENT_MAP\n * 2. Calculate target misspellings based on total words * chance\n * 3. If needed, misspell the longest remaining words using swapAdjacentLetters\n *\n * @param sentence - The input sentence to misspell\n * @param misspellingChance - The probability (0-100) that each word will be misspelled. Defaults to 33.\n * @returns The sentence with some words misspelled\n */\nexport function misspellSentence(\n sentence: string,\n misspellingChance: number = 33\n): string {\n // Split sentence into words and non-word characters (spaces, punctuation, etc.)\n const tokens = sentence.split(/(\\s+|[.,!?;:'\"()[\\]{}])/);\n\n // Track word indices and whether they were misspelled\n interface WordInfo {\n index: number;\n word: string;\n misspelled: boolean;\n isCommonWord: boolean;\n }\n\n const wordInfos: WordInfo[] = [];\n\n // First pass: identify all words and replace common words\n const tokensAfterFirstPass = tokens.map((token, index) => {\n // Only process actual words (not spaces or punctuation)\n if (!/\\w+/.test(token) || token.trim() === \"\") {\n return token;\n }\n\n const isCommonWord = isInReplacementMap(token);\n\n if (isCommonWord) {\n // Replace with misspelled version\n const misspelled = replaceSimilarSound(token);\n wordInfos.push({\n index,\n word: token,\n misspelled: true,\n isCommonWord: true,\n });\n return misspelled;\n } else {\n // Keep original for now\n wordInfos.push({\n index,\n word: token,\n misspelled: false,\n isCommonWord: false,\n });\n return token;\n }\n });\n\n // Count how many words we've misspelled and how many we should misspell\n const totalWords = wordInfos.length;\n const wordsReplaced = wordInfos.filter((w) => w.misspelled).length;\n const targetMisspellings = Math.round((totalWords * misspellingChance) / 100);\n\n // If we need more misspellings, find the longest N words to misspell\n if (wordsReplaced < targetMisspellings) {\n const difference = targetMisspellings - wordsReplaced;\n\n // Get words that haven't been misspelled yet, sorted by length (longest first)\n const unmmisspelledWords = wordInfos\n .filter((w) => !w.misspelled)\n .sort((a, b) => b.word.length - a.word.length);\n\n // Misspell the longest N words\n const wordsToMisspell = unmmisspelledWords.slice(0, difference);\n\n // Apply swapAdjacentLetters to these words\n wordsToMisspell.forEach((wordInfo) => {\n const misspelled = swapAdjacentLetters(wordInfo.word);\n tokensAfterFirstPass[wordInfo.index] = misspelled;\n wordInfo.misspelled = true;\n });\n }\n\n return tokensAfterFirstPass.join(\"\");\n}\n\n/**\n * Checks if a word is in the replacement map (common words that should always be misspelled)\n */\nfunction isInReplacementMap(word: string): boolean {\n return word.toLowerCase() in REPLACEMENT_MAP;\n}\n\n/**\n * Swaps two adjacent letters in a word\n */\nfunction swapAdjacentLetters(word: string): string {\n if (word.length < 2) {\n return word;\n }\n\n // Pick a random position to swap (not the last character)\n const pos = Math.floor(Math.random() * (word.length - 1));\n\n const chars = word.split(\"\");\n // Swap characters at pos and pos+1\n [chars[pos], chars[pos + 1]] = [chars[pos + 1], chars[pos]];\n\n return chars.join(\"\");\n}\n\n/**\n * Replaces whole words with similar-sounding alternatives or common misspellings\n */\nfunction replaceSimilarSound(word: string): string {\n // Check if the word (case-insensitive) is in the replacement map\n const lowerWord = word.toLowerCase();\n const replacements = REPLACEMENT_MAP[lowerWord];\n\n if (replacements && replacements.length > 0) {\n // Pick a random replacement\n const replacement =\n replacements[Math.floor(Math.random() * replacements.length)];\n\n return replacement;\n }\n\n // If no replacement found, fall back to swapping adjacent letters\n return swapAdjacentLetters(word);\n}\n",[229],"f3c15666-c805-11f0-8990-42dde27851f2","main.tsx",522,["D",1763858833829],384,"http","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport { appSiteAssociation, getQuote } from \"./api.ts\";\nimport { App } from \"./App.tsx\";\nimport { quoteCount } from \"./constants.ts\";\n\nfunction client() {\n const root = document.getElementById(\"root\");\n if (root) {\n const uuid = root.dataset.uuid;\n createRoot(root).render();\n }\n}\nif (typeof document !== \"undefined\") {\n client();\n}\n\nexport default async function server(request: Request): Promise {\n const requestPath = new URL(request.url).pathname;\n if (requestPath === \"/quote\") {\n return getQuote(request);\n } else if (requestPath === \"/.well-known/apple-app-site-association\") {\n return appSiteAssociation();\n }\n\n let paramUuid: string | null;\n let numberId: string | undefined;\n let match = requestPath.match(/\\/(\\d+)/);\n if (match && parseInt(match[1]) >= 0) {\n paramUuid = \"cipher-\" + match[1];\n numberId = match[1];\n console.log(\"paramUuid:\", paramUuid);\n } else {\n let randonNum = Math.round(Math.random() * 1000000);\n paramUuid = `cipher-${randonNum}`;\n numberId = `${randonNum}`;\n }\n const displayUuid = paramUuid;\n\n return new Response(\n `\n \n \n Cipher Challenge\n \n \n \n \n

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n }\n );\n}\n","bao-cipher",[235],"02f17e2c-e28c-11f0-a32d-42dde27851f2","letterReplacement.test.ts","02f17ec2-e28c-11f0-a32d-42dde27851f2",523,["D",1766775142106],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\n\n/**\n * Test for letter replacement functionality\n * \n * This test verifies that users can replace letters in filled input boxes\n * without having to hit backspace first. The feature should:\n * 1. Detect when a letter key is pressed on a filled input\n * 2. Clear the old letter from all matching positions\n * 3. Fill the new letter in all matching positions\n * 4. Move focus to the next empty input\n */\n\nDeno.test(\"Letter replacement - simulates the desired behavior\", () => {\n // Simulate initial state with some letters filled\n const decryptionAttempt = [\"A\", \"B\", \"C\", \"\", \"\", \"A\", \"\", \"B\"];\n const encodedLettersOnly = \"XYZWQXRY\"; // Encoded cipher text (letters only)\n const letterIndex = 0; // User is focused on first input which has \"A\"\n const newLetter = \"D\"; // User types \"D\"\n \n // Simulate the replacement logic\n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Clear all instances of the encoded letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n // Verify the replacement worked correctly\n assertEquals(newAttempt[0], \"D\", \"First position (X) should now be D\");\n assertEquals(newAttempt[5], \"D\", \"Sixth position (also X) should now be D\");\n assertEquals(newAttempt[1], \"B\", \"Second position (Y) should remain B\");\n assertEquals(newAttempt[2], \"C\", \"Third position (Z) should remain C\");\n assertEquals(newAttempt[7], \"B\", \"Eighth position (Y) should remain B\");\n});\n\nDeno.test(\"Letter replacement - handles empty fields correctly\", () => {\n // When field is empty, normal input should work\n const decryptionAttempt = [\"\", \"B\", \"C\", \"\", \"\", \"\", \"\", \"B\"];\n const encodedLettersOnly = \"XYZWQXRY\";\n const letterIndex = 0; // User is focused on first input which is empty\n const newLetter = \"A\";\n \n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Since the regex test /^[a-zA-Z]$/.test(event.key) && decryptionAttempt[letterIndex]\n // would be false (field is empty), this path wouldn't execute\n // But let's test that the normal handleLetterChange would work\n \n // Set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n assertEquals(newAttempt[0], \"A\", \"First position should be A\");\n assertEquals(newAttempt[5], \"A\", \"Sixth position should also be A (same encoded letter)\");\n});\n\nDeno.test(\"Letter replacement - replaces multiple instances\", () => {\n // When replacing a letter that appears multiple times\n const decryptionAttempt = [\"T\", \"E\", \"S\", \"T\", \"\", \"T\", \"E\", \"\"];\n const encodedLettersOnly = \"XYZXQXYQ\"; // X appears at indices 0, 3, 5\n const letterIndex = 0; // Replacing \"T\" (encoded as X)\n const newLetter = \"R\";\n \n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Clear all X positions\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Set all X positions to new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n assertEquals(newAttempt[0], \"R\", \"Position 0 should be R\");\n assertEquals(newAttempt[3], \"R\", \"Position 3 should be R\");\n assertEquals(newAttempt[5], \"R\", \"Position 5 should be R\");\n assertEquals(newAttempt[1], \"E\", \"Position 1 should remain E\");\n assertEquals(newAttempt[2], \"S\", \"Position 2 should remain S\");\n assertEquals(newAttempt[6], \"E\", \"Position 6 should remain E\");\n});\n\n",[244],"c7daf664-e3b8-11f0-9c20-42dde27851f2","hardModeAristocrat.test.ts","b1eacb8c-e3b2-11f0-9b4c-42dde27851f2",["D",1766904321471],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\n\n/**\n * Test for hard mode aristocrat misspelling bug\n * \n * Bug: When hard mode aristocrat is played with type=\"random\", creating a misspelled\n * cipher would generate a NEW random substitution map, causing the same cipher letter\n * to map to different plaintext letters, making the puzzle unsolvable.\n * \n * Fix: When creating the misspelled cipher, we reuse the original cipher's substitution\n * map to ensure consistency.\n */\n\nDeno.test(\"Hard mode aristocrat - reuses substitution map for misspelled text\", () => {\n // Create original cipher with random type\n const originalText = \"I KNOW YOUR LIFE\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Misspell the text (simulating hard mode)\n const misspelledText = misspellSentence(originalText);\n \n // Create misspelled cipher WITHOUT reusing map (this is the bug)\n const misspelledCipherWithBug = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Create misspelled cipher WITH reusing map (this is the fix)\n const misspelledCipherFixed = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // Verify the bug: different maps for same letter\n // For example, if original has A->X, the buggy version might have A->Y\n const letterA_original = originalCipher.substitutionMap[\"A\"];\n const letterA_buggy = misspelledCipherWithBug.substitutionMap[\"A\"];\n const letterA_fixed = misspelledCipherFixed.substitutionMap[\"A\"];\n \n console.log(\"Original A maps to:\", letterA_original);\n console.log(\"Buggy A maps to:\", letterA_buggy);\n console.log(\"Fixed A maps to:\", letterA_fixed);\n \n // The buggy version will likely have different mapping (random)\n // The fixed version should have the same mapping as original\n assertEquals(\n letterA_fixed,\n letterA_original,\n \"Fixed version should use the same substitution map as original\"\n );\n \n // Check all 26 letters\n for (let i = 0; i < 26; i++) {\n const letter = String.fromCharCode(65 + i); // A-Z\n assertEquals(\n misspelledCipherFixed.substitutionMap[letter],\n originalCipher.substitutionMap[letter],\n `Letter ${letter} should map to the same cipher letter in both original and misspelled versions`\n );\n }\n});\n\nDeno.test(\"Hard mode aristocrat - consistency check with K1 cipher\", () => {\n // Test with K1 to ensure the fix works for non-random types too\n const originalText = \"HELLO WORLD\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"SECRET\",\n positionLetter: \"D\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n });\n \n const misspelledText = \"HELO WRLD\"; // Manually misspelled\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: \"SECRET\",\n positionLetter: \"D\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // K1 with same keyword should generate same map anyway, but let's verify\n assertEquals(\n misspelledCipher.substitutionMap,\n originalCipher.substitutionMap,\n \"K1 cipher should have consistent substitution map\"\n );\n});\n\nDeno.test(\"Hard mode aristocrat - encoded text uses correct mapping\", () => {\n // Create a simple example to verify encoding is correct\n const originalText = \"AAA BBB\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Get what A and B map to\n const cipherA = originalCipher.substitutionMap[\"A\"];\n const cipherB = originalCipher.substitutionMap[\"B\"];\n \n // Create misspelled version with different letters\n const misspelledText = \"AAB BBA\";\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // Expected encoded text: AAB BBA -> cipherA cipherA cipherB space cipherB cipherB cipherA\n const expectedEncoded = `${cipherA}${cipherA}${cipherB} ${cipherB}${cipherB}${cipherA}`;\n assertEquals(\n misspelledCipher.encoded,\n expectedEncoded,\n \"Misspelled text should encode correctly using the original substitution map\"\n );\n});\n\nDeno.test(\"Pre-generated misspelled text - consistency across game loads\", () => {\n // Test that pre-generating misspelled text ensures consistency\n const originalText = \"I KNOW YOUR LIFE\";\n const preGeneratedMisspelled = \"I NO UR LYFE\"; // Simulated pre-generated misspelling\n \n // Create cipher with pre-generated misspelled version\n const cipher = substitutionEncode({\n plainText: originalText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n misspelledOriginal: preGeneratedMisspelled,\n });\n \n // Verify misspelled version is stored\n assertEquals(\n cipher.misspelledOriginal,\n preGeneratedMisspelled,\n \"Pre-generated misspelled text should be stored in cipher\"\n );\n \n // Simulate loading the same game (with misspelled version available)\n const misspelledCipher = substitutionEncode({\n plainText: preGeneratedMisspelled,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: cipher.substitutionMap,\n existingReverseSubstitutionMap: cipher.reverseSubstitutionMap,\n misspelledOriginal: preGeneratedMisspelled,\n });\n \n // Verify consistency: same substitution map and same misspelled text\n assertEquals(\n misspelledCipher.substitutionMap,\n cipher.substitutionMap,\n \"Substitution map should be identical across game loads\"\n );\n assertEquals(\n misspelledCipher.original,\n preGeneratedMisspelled,\n \"Misspelled text should be used as the plaintext\"\n );\n});\n\n",[251],"d41a3a1a-4422-11f0-89d5-76b3cceeab13","gameHelpers.ts","d41a3b5a-4422-11f0-89d5-76b3cceeab13",378,["D",1749357682642],"import { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\n\nexport function startNewGame(input: string) {\n const number = parseInt(input.replace(\"cipher-\", \"\"));\n if (number >= 0) {\n const newId = `cipher-${number + 1}`;\n window.location.href = `${window.location.origin}/${newId.replace(\"cipher-\", \"\")}`;\n } else {\n present(\"The game is not available yet\");\n }\n}\n\nexport function present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nexport function appendToLocalStorage(text: string, author: string | null): void {\n const newValue = `${text} - ${author ?? \"\"}`;\n if (isMobileNative()) {\n void sendBridgeMessage({ action: \"appendKnownQuote\", data: { quote: newValue } });\n return;\n }\n\n const key = \"known_texts\";\n // Get the existing data from local storage\n const storedData = localStorage.getItem(key);\n\n // If it exists, parse it; otherwise, use an empty array\n let arr: string[] = storedData ? JSON.parse(storedData) : [];\n\n // Push the new value onto the array if it is not already in it\n if (!arr.includes(newValue)) {\n arr.push(newValue);\n }\n\n // Save the updated array back to local storage\n localStorage.setItem(key, JSON.stringify(arr));\n}\n\nexport function isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nexport async function getKnownTexts(): Promise {\n if (isMobileNative()) {\n const result = await sendBridgeMessage({ action: \"requestKnownQuotes\", data: {} });\n return result?.[\"quotes\"] ?? [];\n }\n const key = \"known_texts\";\n const storedData = localStorage.getItem(key);\n return storedData ? JSON.parse(storedData) : [];\n}",[257],"5a9080aa-255e-11f1-992e-42dde27851f2","constants.ts","d41a38e4-4422-11f0-89d5-76b3cceeab13",534,["D",1774122260147],23,"export const quoteCount = 6737;\n\nexport const tutorialUrl = \"https://baolei.notion.site/ciphertutorial\";\nexport const strategyUrl = \"https://baolei.notion.site/cipherstrategy\";\n",[264],"6386d184-a721-11f0-a70d-0224a6c84d84","cipherHelpers.ts","2975a900-a6e7-11f0-a077-0224a6c84d84",504,["D",1760242229389],"export function getCipherName(\n type: string,\n keyword: string,\n groupingType: string\n): string {\n // Caesar cipher is a special case of K1 aristocrat with empty keyword\n if (type === \"k1\" && keyword === \"\" && groupingType === \"aristocrat\") {\n return \"Caesar Cipher\";\n }\n\n // Capitalize first letter of type and groupingType\n const capitalizedType = type.charAt(0).toUpperCase() + type.slice(1);\n const capitalizedGrouping =\n groupingType.charAt(0).toUpperCase() + groupingType.slice(1);\n\n return `${capitalizedType} ${capitalizedGrouping}`;\n}\n",[272],"229d8704-a798-11f0-8271-0224a6c84d84","bridge.ts","d41a35f6-4422-11f0-89d5-76b3cceeab13",["D",1760293230598],"export function isMobileNative(): boolean {\n return Boolean((globalThis as any).window?.WebNativeBridge);\n}\n\nexport async function sendBridgeMessage(message: {\n action: string;\n data: any;\n}): Promise {\n return await (globalThis as any).window?.WebNativeBridge?.webToNative?.(\n message\n );\n}\n",[279],"02f23eb6-e28c-11f0-a32d-42dde27851f2","appSiteAssociation.test.ts","f3c14a04-c805-11f0-8990-42dde27851f2",["D",1766775142106],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { appSiteAssociation } from \"./api.ts\";\nimport server from \"./main.tsx\";\n\nDeno.test(\"appSiteAssociation - function exists and returns correct response\", async () => {\n const response = appSiteAssociation();\n \n // Check that response is returned\n assertEquals(response instanceof Response, true, \"appSiteAssociation should return a Response object\");\n \n // Check headers\n assertEquals(\n response.headers.get(\"Content-Type\"),\n \"application/json\",\n \"Response should have Content-Type: application/json\"\n );\n \n // Check response body\n const body = await response.json();\n assertEquals(\n body.applinks !== undefined,\n true,\n \"Response should contain applinks object\"\n );\n assertEquals(\n body.applinks.details !== undefined,\n true,\n \"applinks should contain details array\"\n );\n assertEquals(\n body.applinks.details.length > 0,\n true,\n \"details array should not be empty\"\n );\n assertEquals(\n body.applinks.details[0].appIDs.includes(\"869W3P5ZRS.fyi.lei.cipher\"),\n true,\n \"appIDs should contain the correct app ID\"\n );\n});\n\nDeno.test(\"server - routes .well-known/apple-app-site-association correctly\", async () => {\n const request = new Request(\"https://example.com/.well-known/apple-app-site-association\");\n const response = await server(request);\n \n // Check that response is returned\n assertEquals(response instanceof Response, true, \"Server should return a Response object\");\n \n // Check headers\n assertEquals(\n response.headers.get(\"Content-Type\"),\n \"application/json\",\n \"Response should have Content-Type: application/json\"\n );\n \n // Check response body\n const body = await response.json();\n assertEquals(\n body.applinks !== undefined,\n true,\n \"Response should contain applinks object\"\n );\n});\n\nDeno.test(\"server - HTML includes apple-itunes-app meta tag\", async () => {\n const request = new Request(\"https://example.com/123\");\n const response = await server(request);\n \n // Check that response is HTML\n assertEquals(\n response.headers.get(\"content-type\"),\n \"text/html\",\n \"Response should have content-type: text/html\"\n );\n \n // Check response body contains the meta tag\n const html = await response.text();\n assertEquals(\n html.includes('name=\"apple-itunes-app\"'),\n true,\n \"HTML should contain apple-itunes-app meta tag\"\n );\n assertEquals(\n html.includes('app-id=6742675455'),\n true,\n \"Meta tag should contain correct app-id\"\n );\n assertEquals(\n html.includes('app-argument=https://cipher.lei.fyi/123'),\n true,\n \"Meta tag should contain correct app-argument with the game ID\"\n );\n});\n\nDeno.test(\"server - HTML includes correct numberId in apple-itunes-app meta tag for random games\", async () => {\n const request = new Request(\"https://example.com/\");\n const response = await server(request);\n \n // Check that response is HTML\n const html = await response.text();\n \n // Extract the numberId from the meta tag\n const metaTagMatch = html.match(/app-argument=https:\\/\\/cipher\\.lei\\.fyi\\/(\\d+)/);\n assertEquals(\n metaTagMatch !== null,\n true,\n \"HTML should contain apple-itunes-app meta tag with a numeric game ID\"\n );\n \n if (metaTagMatch) {\n const numberId = metaTagMatch[1];\n // Check that the same numberId is in the data-uuid attribute\n assertEquals(\n html.includes(`data-uuid=\"cipher-${numberId}\"`),\n true,\n \"The numberId in apple-itunes-app should match the one in data-uuid\"\n );\n }\n});\n\n\n",[285],"b0b954ee-abeb-11f0-8ee2-0224a6c84d84","api.ts","d419ff96-4422-11f0-89d5-76b3cceeab13",508,["D",1760768921885],8,"import { quoteCount } from \"./constants.ts\";\nimport { randomWordFromSentence } from \"./wordHelpers.ts\";\n\n// Deno runtime type declaration\ndeclare const Deno: {\n env: {\n get(key: string): string | undefined;\n };\n};\n\n/**\n * API Specification for getQuote endpoint\n *\n * Path:\n * /quote\n *\n * Query Parameters:\n * - pageId (optional): The starting quote ID. If not provided, a random ID is selected.\n * - count (optional): The number of quotes to return. Must be used with pageId.\n *\n * Response Formats:\n *\n * 1. Single Quote Mode (when count is NOT provided):\n * Returns a single quote object:\n * {\n * quote: string, // The quote text\n * author: string, // The author name\n * keyword: string, // A random word from a previous quote\n * quoteId: number // The quote's unique ID\n * }\n *\n * 2. Multiple Quotes Mode (when both count AND pageId are provided):\n * Returns an array of quote objects:\n * [\n * {\n * quote: string,\n * author: string,\n * quoteId: number\n * },\n * ...\n * ]\n * Returns exactly 'count' quotes starting from 'pageId'.\n * Note: keyword is not included in multi-quote mode.\n */\nexport async function getQuote(request: Request): Promise {\n const url = new URL(request.url);\n const pageId =\n url.searchParams.get(\"pageId\") ??\n Math.floor(Math.random() * quoteCount + 1).toString();\n const pageIdInt = parseInt(pageId);\n const countParam = url.searchParams.get(\"count\");\n const count = countParam ? parseInt(countParam) : null;\n\n console.log(\"Page ID:\", pageIdInt);\n if (count !== null) {\n console.log(\"Count:\", count);\n }\n\n try {\n const notionToken = Deno.env.get(\"Notion_ready_only_api_token\");\n if (!notionToken) {\n throw new Error(\"Notion API token not found\");\n }\n const databaseId = \"16e2c190bff080fd9ea8d2a8c21548b0\";\n\n // Determine the range to fetch based on count parameter\n const maxId =\n count !== null && url.searchParams.has(\"pageId\")\n ? pageIdInt + count - 1\n : pageIdInt + 10; // load a few more to make sure we have one that's long enough\n const minId =\n count !== null && url.searchParams.has(\"pageId\")\n ? pageIdInt\n : Math.max(1, pageIdInt - 1); // load a few more to make sure we have one that's long enough\n\n // Use database query with filter instead of direct page fetch\n const response = await fetch(\n `https://api.notion.com/v1/databases/${databaseId}/query`,\n {\n method: \"POST\",\n headers: {\n Authorization: `Bearer ${notionToken}`,\n \"Notion-Version\": \"2022-06-28\",\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n filter: {\n and: [\n {\n property: \"ID\", // Uppercase ID property\n unique_id: {\n less_than_or_equal_to: maxId,\n },\n },\n {\n property: \"ID\", // Uppercase ID property\n unique_id: {\n greater_than_or_equal_to: minId,\n },\n },\n ],\n },\n sorts: [\n {\n property: \"ID\",\n direction: \"ascending\",\n },\n ],\n }),\n }\n );\n // console.log(response);\n\n if (!response.ok) {\n throw new Error(\n `Failed to query Notion database: ${response.statusText}`\n );\n }\n\n const data = await response.json();\n console.log(`Fetched ${data.results.length} pages from Notion API`);\n\n // Multi-quote mode: return list of quotes when count and pageId are both provided\n if (count !== null && url.searchParams.has(\"pageId\")) {\n const quotes: Array<{ quote: string; author: string; quoteId: number }> =\n [];\n for (const page of data.results) {\n const quote = page.properties.quote?.rich_text?.[0]?.plain_text || \"\";\n const author = page.properties.author?.rich_text?.[0]?.plain_text || \"\";\n const quoteId = page.properties.ID.unique_id?.number ?? 0;\n\n if (quote.length >= 1) {\n quotes.push({ quote, author, quoteId });\n }\n\n if (quotes.length >= count) {\n break;\n }\n }\n\n if (quotes.length === 0) {\n throw new Error(`No quotes found starting from ID ${pageId}`);\n }\n\n return new Response(JSON.stringify(quotes), {\n headers: { \"Content-Type\": \"application/json\" },\n });\n }\n\n // Single quote mode: original behavior with keyword\n let keyword = \"\";\n for (const page of data.results) {\n // console.log(\"Checking page\", page.properties.ID);\n // Extract plain text from rich text properties\n const quote = page.properties.quote?.rich_text?.[0]?.plain_text || \"\";\n const author = page.properties.author?.rich_text?.[0]?.plain_text || \"\";\n const quoteId = page.properties.ID.unique_id?.number ?? 0;\n if (!keyword) {\n keyword = randomWordFromSentence(quote);\n // console.log(\"Found a keyword\", keyword);\n continue;\n }\n if (quote.length >= 1) {\n // console.log(\"Found a quote long enough\", quote);\n return new Response(\n JSON.stringify({ quote, author, keyword, quoteId }),\n {\n headers: { \"Content-Type\": \"application/json\" },\n }\n );\n }\n }\n\n throw new Error(`No page found with ID ${pageId}`);\n } catch (error) {\n return new Response(JSON.stringify({ error: error.message }), {\n status: 500,\n headers: { \"Content-Type\": \"application/json\" },\n });\n }\n}\n\nexport function appSiteAssociation(): Response {\n return new Response(\n JSON.stringify({\n applinks: {\n details: [\n {\n appIDs: [\"869W3P5ZRS.fyi.lei.cipher\"],\n components: [\n {\n \"/\": \"/*\",\n comment: \"matches all\",\n },\n ],\n },\n ],\n },\n }),\n {\n headers: { \"Content-Type\": \"application/json\" },\n }\n );\n}\n",[291],"ce826916-0ac3-11f1-a72d-42dde27851f2","analyze_quotes.js","ce8269de-0ac3-11f1-a72d-42dde27851f2",528,["D",1771197152424],"#!/usr/bin/env node\n\n/**\n * Script to fetch all quotes from the Cipher API and analyze authors and words\n *\n * This script:\n * 1. Fetches quotes in batches of 100 starting from pageId 1\n * 2. Continues until no more quotes are found\n * 3. Analyzes and displays the top 25 authors by quote count\n * 4. Analyzes and displays the most frequent words (4+ letters)\n */\n\nconst API_ENDPOINT = \"https://cipher.lei.fyi/quote\";\nconst BATCH_SIZE = 100;\n\n// ANSI escape codes for terminal control\nconst CLEAR_LINE = \"\\x1b[2K\";\nconst CURSOR_UP = \"\\x1b[1A\";\nconst CURSOR_HOME = \"\\x1b[H\";\nconst CLEAR_SCREEN = \"\\x1b[2J\";\nconst HIDE_CURSOR = \"\\x1b[?25l\";\nconst SHOW_CURSOR = \"\\x1b[?25h\";\n\nasync function fetchQuotes(pageId, count) {\n const url = `${API_ENDPOINT}?pageId=${pageId}&count=${count}`;\n\n try {\n const response = await fetch(url);\n const data = await response.json();\n\n // Check if we got an error\n if (data.error) {\n return null;\n }\n\n // Check if data is an array (multi-quote mode)\n if (Array.isArray(data)) {\n return data;\n }\n\n return null;\n } catch (error) {\n return null;\n }\n}\n\nfunction updateDisplay(stats) {\n // Clear screen and move cursor to home\n process.stdout.write(CLEAR_SCREEN + CURSOR_HOME);\n\n // Header\n\n // Progress stats\n console.log(` Total quotes fetched: ${stats.totalQuotes}`);\n console.log(` Unique authors: ${stats.uniqueAuthors}`);\n console.log();\n\n // Top authors section\n\n if (stats.topAuthors.length === 0) {\n console.log(\" (Loading...)\");\n } else {\n stats.topAuthors.forEach((item, index) => {\n const rank = (index + 1).toString().padStart(3);\n const count = item.count.toString().padStart(5);\n const bar = \"█\".repeat(Math.min(50, Math.floor(item.count / 10)));\n console.log(` ${rank}. ${item.author.padEnd(35)} ${count} ${bar}`);\n });\n }\n\n // Top words section\n console.log(\"-\".repeat(70));\n\n if (!stats.topWords || stats.topWords.length === 0) {\n console.log(\" (Loading...)\");\n } else {\n // Display in 3 columns\n const wordsPerColumn = 66 / 3;\n for (let i = 0; i < wordsPerColumn; i++) {\n const col1 = stats.topWords[i];\n const col2 = stats.topWords[i + wordsPerColumn];\n const col3 = stats.topWords[i + wordsPerColumn * 2];\n\n let line = \"\";\n if (col1) {\n const rank = (i + 1).toString().padStart(3);\n const count = col1.count.toString().padStart(5);\n line += ` ${rank}. ${col1.word.padEnd(12)} ${count}`;\n }\n\n if (col2) {\n const padding = col1 ? \" \" : \" \".repeat(25);\n const rank = (i + wordsPerColumn + 1).toString().padStart(3);\n const count = col2.count.toString().padStart(5);\n line += `${padding}${rank}. ${col2.word.padEnd(12)} ${count}`;\n }\n\n if (col3) {\n const padding = col2 ? \" \" : \" \".repeat(25);\n const rank = (i + wordsPerColumn * 2 + 1).toString().padStart(3);\n const count = col3.count.toString().padStart(5);\n line += `${padding}${rank}. ${col3.word.padEnd(12)} ${count}`;\n }\n\n console.log(line);\n }\n }\n\n console.log(\"=\".repeat(70));\n\n if (stats.isComplete) {\n console.log(\"✅ FETCH COMPLETE!\");\n } else {\n console.log(\"⏳ Fetching...\");\n }\n}\n\nfunction sanitizeAuthorName(author) {\n if (!author) return \"Unknown\";\n\n // Remove content in parentheses\n let sanitized = author.replace(/\$[^)]*\$/g, \"\");\n\n // Remove common suffixes (Jr., Jr, Sr., Sr, III, etc.)\n sanitized = sanitized.replace(/\\b(Jr\\.?|Sr\\.?|III|II|IV)\\b\\.?/gi, \"\");\n\n // Remove standalone periods and extra whitespace\n sanitized = sanitized.replace(/\\s+\\./g, \"\").replace(/\\.\\s+/g, \" \");\n\n // Trim whitespace\n sanitized = sanitized.trim();\n\n // Split into words (filter out periods and empty strings)\n const words = sanitized.split(/\\s+/).filter((w) => w.length > 0 && w !== \".\");\n\n // If 2 or more words, use first + last only\n if (words.length >= 2) {\n sanitized = `${words[0]} ${words[words.length - 1]}`;\n } else if (words.length === 1) {\n sanitized = words[0];\n } else {\n return \"Unknown\";\n }\n\n return sanitized || \"Unknown\";\n}\n\nfunction analyzeWordsLive(quotes) {\n const wordCounts = {};\n\n // Extract words from all quotes\n for (const quote of quotes) {\n if (!quote.quote) continue;\n\n // Extract words (letters only, at least 4 chars)\n const words = quote.quote.toLowerCase().match(/[a-z]{4,}/g) || [];\n\n for (const word of words) {\n wordCounts[word] = (wordCounts[word] || 0) + 1;\n }\n }\n\n // Get top words by frequency\n const topWords = Object.entries(wordCounts)\n .map(([word, count]) => ({ word, count }))\n .sort((a, b) => b.count - a.count)\n .slice(0, 66);\n\n return {\n wordCounts,\n topWords,\n totalWords: Object.keys(wordCounts).length,\n };\n}\n\nfunction analyzeAuthorsLive(quotes) {\n const authorCounts = {};\n\n // Count quotes per author with sanitized names\n for (const quote of quotes) {\n const author = sanitizeAuthorName(quote.author);\n authorCounts[author] = (authorCounts[author] || 0) + 1;\n }\n\n // Get top 25 authors by quote count\n const topAuthors = Object.entries(authorCounts)\n .map(([author, count]) => ({ author, count }))\n .sort((a, b) => b.count - a.count)\n .slice(0, 25);\n\n return {\n authorCounts,\n topAuthors,\n uniqueAuthors: Object.keys(authorCounts).length,\n };\n}\n\nasync function fetchAllQuotes() {\n const allQuotes = [];\n let pageId = 1;\n let continueLooping = true;\n const startTime = Date.now();\n\n // Hide cursor for cleaner display\n process.stdout.write(HIDE_CURSOR);\n\n while (continueLooping) {\n const quotes = await fetchQuotes(pageId, BATCH_SIZE);\n\n if (quotes === null || quotes.length === 0) {\n continueLooping = false;\n } else {\n allQuotes.push(...quotes);\n\n // Analyze and display current state\n const authorAnalysis = analyzeAuthorsLive(allQuotes);\n const wordAnalysis = analyzeWordsLive(allQuotes);\n const elapsedTime = ((Date.now() - startTime) / 1000).toFixed(1);\n\n updateDisplay({\n totalQuotes: allQuotes.length,\n currentPageId: pageId,\n uniqueAuthors: authorAnalysis.uniqueAuthors,\n topAuthors: authorAnalysis.topAuthors,\n uniqueWords: wordAnalysis.totalWords,\n topWords: wordAnalysis.topWords,\n elapsedTime,\n isComplete: false,\n });\n\n pageId += BATCH_SIZE;\n\n // Add a small delay to be nice to the API\n await new Promise((resolve) => setTimeout(resolve, 100));\n }\n }\n\n // Final update\n const authorAnalysis = analyzeAuthorsLive(allQuotes);\n const wordAnalysis = analyzeWordsLive(allQuotes);\n const elapsedTime = ((Date.now() - startTime) / 1000).toFixed(1);\n\n updateDisplay({\n totalQuotes: allQuotes.length,\n currentPageId: pageId,\n uniqueAuthors: authorAnalysis.uniqueAuthors,\n topAuthors: authorAnalysis.topAuthors,\n uniqueWords: wordAnalysis.totalWords,\n topWords: wordAnalysis.topWords,\n elapsedTime,\n isComplete: true,\n });\n\n // Show cursor again\n process.stdout.write(SHOW_CURSOR);\n\n return allQuotes;\n}\n\nasync function main() {\n try {\n // Clear screen at start\n process.stdout.write(CLEAR_SCREEN + CURSOR_HOME);\n console.log(\"Starting quote analysis...\\n\");\n await new Promise((resolve) => setTimeout(resolve, 1000));\n\n const quotes = await fetchAllQuotes();\n\n if (quotes.length === 0) {\n console.log(\"\\n❌ No quotes were fetched. Exiting.\");\n return;\n }\n\n console.log(\"\\n✨ Analysis complete! Press Ctrl+C to exit.\");\n } catch (error) {\n // Make sure cursor is visible on error\n process.stdout.write(SHOW_CURSOR);\n throw error;\n }\n}\n\n// Handle Ctrl+C gracefully\nprocess.on(\"SIGINT\", () => {\n process.stdout.write(SHOW_CURSOR);\n console.log(\"\\n\\n👋 Exiting...\");\n process.exit(0);\n});\n\nmain().catch((error) => {\n console.error(\"Fatal error:\", error);\n process.exit(1);\n});",[299],"8901727e-2793-11f0-9d52-569c3dd06744","README.md","8901731e-2793-11f0-9d52-569c3dd06744",["D",1735608699289],"A web app to practice aristocrat and patristocrat cipher decoding.",[306],"2975aaa4-a6e7-11f0-a077-0224a6c84d84","PUNCTUATION_FEATURE.md","2975ab12-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"# Punctuation Preservation Feature\n\n## Summary\n\nSuccessfully implemented punctuation preservation for Aristocrat ciphers while maintaining punctuation stripping for Patristocrat ciphers.\n\n## Changes Made\n\n### 1. `substitutionCipher.ts`\n\n- **Line 148-158**: Updated aristocrat encoding to preserve all punctuation and spacing\n- **Line 174**: Fixed TypeScript type annotation for `encodedLetterCounts`\n\n**Key Logic:**\n\n- Aristocrat: Encode only letters (`/[A-Z]/`), preserve everything else (spaces, punctuation)\n- Patristocrat: Strip all non-letters, group into 5-letter blocks (no change from before)\n\n### 2. `App.tsx`\n\nUpdated to handle letter-only indexing while displaying punctuation:\n\n#### New Helper Functions (Lines 503-534):\n\n- `visualIndexFor()`: Maps group/char position to visual position in encoded string\n- `letterIndexFromVisual()`: Converts visual position to letter-only array index\n- `isLetterAtVisual()`: Checks if character at position is a letter\n\n#### Updated Functions:\n\n- `handleLetterChange()`: Works with letter-only indices, finds matching encoded letters\n- `handleKeyDown()`: Backspace handling with letter-only indices\n- `handleClear()`: Clears only letter positions\n- `isDuplicated()`: Checks duplicates using letter-only indices\n- `attemptedOriginalFor()`: Maps encoded letters to attempted decryption\n- `attemptedEncodedFor()`: Maps attempted letters to encoded letters\n\n#### Initialization (Lines 92-98, 169-175):\n\n- `decryptionAttempt` now only tracks letters: `cipher.encoded.replace(/[^A-Z]/g, '')`\n- Input refs array sized for letters only\n\n#### Rendering (Lines 609-682):\n\n- Display layer: Shows all characters including punctuation\n- Input layer: Only creates input boxes for letters, displays punctuation as text\n\n### 3. `substitutionCipher.test.ts` (New File)\n\nComprehensive test suite with 8 tests:\n\n1. **Aristocrat - preserves punctuation and spacing**: Verifies commas, periods, exclamation marks, etc. are preserved\n2. **Aristocrat - letters are properly substituted**: Validates correct substitution with apostrophes\n3. **Patristocrat - strips punctuation and groups into 5-letter blocks**: Ensures no punctuation in output\n4. **Patristocrat - same substitution but different formatting**: Confirms both use same cipher\n5. **Caesar cipher - aristocrat preserves punctuation**: Tests Caesar as K1 with empty keyword\n6. **Letter counts - only counts letters**: Verifies punctuation doesn't affect frequency analysis\n7. **cleanOriginal - only contains letters**: Ensures answer checking works correctly\n8. **Various punctuation marks**: Tests hyphens, ellipses, parentheses, etc.\n\n**All tests pass! ✅**\n\n## How It Works\n\n### Data Structure\n\n- `cipher.encoded`: Full string with letters, spaces, and punctuation (aristocrat) or letters + spaces only (patristocrat)\n- `decryptionAttempt[]`: Array of only letters (no punctuation or spaces)\n- Mapping: Helper functions convert between visual positions and letter-only array indices\n\n### Example Flow\n\n**Input:** `\"Hello, World!\"`\n\n**Aristocrat Mode:**\n\n- `cipher.encoded`: `\"KHOOR, ZRUOG!\"` (letters encoded, punctuation preserved)\n- `decryptionAttempt`: `[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]` (10 letters only)\n- User sees: `K H O O R , W R U O G !` with inputs only under letters\n\n**Patristocrat Mode:**\n\n- `cipher.encoded`: `\"KHOOR ZRUOG\"` (punctuation stripped, grouped)\n- `decryptionAttempt`: `[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]` (same 10 letters)\n- User sees: `KHOOR ZRUOG` with inputs under all characters\n\n## Benefits\n\n1. **More authentic**: Real cryptograms preserve punctuation\n2. **Better hints**: Punctuation provides clues about sentence structure\n3. **Cleaner code**: Separation between display (with punctuation) and state (letters only)\n4. **Backward compatible**: Patristocrat unchanged, existing games work\n5. **Well tested**: Comprehensive test coverage ensures correctness\n\n## Testing\n\nRun tests:\n\n```bash\ndeno test substitutionCipher.test.ts\n```\n\nAll 8 tests pass with type checking enabled.\n",[312],"49467468-1045-11f1-97d3-42dde27851f2","Notice.tsx","0d04bde6-4428-11f0-a96c-76b3cceeab13",530,["D",1771802519305],18,"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { sendBridgeMessage } from \"./bridge.ts\";\nimport { getCipherName } from \"./cipherHelpers.ts\";\nimport { tutorialUrl, strategyUrl } from \"./constants.ts\";\n\nexport function Notice({\n type,\n groupingType,\n keyword,\n}: {\n type?: string;\n groupingType?: string;\n keyword?: string;\n}) {\n return (\n \n

\n URGENT NOTICE\n

\n
\n We’ve intercepted an enemy telegraph with top-secret plans. Your\n mission is to crack the cipher before the enemy strikes. Lives depend on\n your speed and precision!\n
\n
\n {type && groupingType && keyword !== undefined && (\n

\n The message is encrypted with{\" \"}\n {getCipherName(type, keyword, groupingType)}. Learn the{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: tutorialUrl },\n })\n }\n >\n rules\n {\" \"}\n and{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: strategyUrl },\n })\n }\n >\n strategies\n \n .\n

\n )}\n \n );\n}\n",[318],"f8d203a0-a71f-11f0-bd90-0224a6c84d84","Loading.tsx","0d04bb8e-4428-11f0-a96c-76b3cceeab13",501,["D",1760241620865],16,"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\nimport { tutorialUrl } from \"./constants.ts\";\n\nexport function Loading() {\n return (\n \n {!isMobileNative() && (\n

Cipher Challenge 🕵️

\n )}\n \n Our agents are still busy at work retrieving intel. Due to the nature of\n this work, no further details can be provided.\n
\n
\n Just hang on for a for a few more seconds...\n
\n
\n In the meantime you can study the{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: tutorialUrl },\n })\n }\n >\n rulebook\n {\" \"}\n and the{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: strategyUrl },\n })\n }\n >\n strategies\n \n .\n \n \n );\n}\n",[326],"4862820c-44d6-11f0-9fd0-76b3cceeab13","KnownTextWarning.tsx","0d04b0da-4428-11f0-a96c-76b3cceeab13",399,["D",1749434757648],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { useState } from \"https://esm.sh/react@18.2.0\";\nimport { isMobileNative } from \"./bridge.ts\";\nimport { startNewGame } from \"./gameHelpers.ts\";\n\nexport function KnownTextWarning(\n { cipherText, knownTexts, uuid }: { cipherText: string; knownTexts: string[]; uuid: string },\n) {\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n\n return (\n

\n You have decoded this one before.\n

\n {!isMobileNative()\n ? (\n {\n setKnownTextsShown(!knownTextsShown);\n }}\n style={{\n marginTop: \"5pt\",\n padding: \"10pt\",\n backgroundColor: \"#4CAF50\",\n color: \"white\",\n border: \"none\",\n flex: 1,\n }}\n >\n {knownTextsShown ? \"Hide solved texts\" : \"Show solved texts\"}\n \n )\n : (\n {\n startNewGame(uuid);\n }}\n style={{\n marginTop: \"5pt\",\n padding: \"10pt\",\n backgroundColor: \"#4CAF50\",\n color: \"white\",\n border: \"none\",\n flex: 1,\n }}\n >\n Try another one\n \n )}\n {knownTextsShown && (\n

= 0 ? \"bold\" : \"regular\" }}>\n {text}\n

\n )}\n

\n );\n}",[334],"4f346a50-44d6-11f0-bc1a-76b3cceeab13","GameResult.tsx","7e3cb3f2-442c-11f0-8338-76b3cceeab13",400,["D",1749434769089],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\n\nexport function GameResult({ uuid }: { uuid: string }) {\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n return (\n \n See{\" \"}\n {\n void sendBridgeMessage({ action: \"openLink\", data: { url: resultUrl } });\n }}\n >\n Game Result\n \n \n );\n}",[341],"46409426-1043-11f1-9c5b-42dde27851f2","GameLink.tsx","7e3cb1a4-442c-11f0-8338-76b3cceeab13",529,["D",1771801655240],5,"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { useState } from \"https://esm.sh/react@18.2.0\";\nimport { isMobileNative } from \"./bridge.ts\";\n\nexport function GameLink({\n uuid,\n currentUrl,\n}: {\n uuid: string;\n currentUrl: string;\n}) {\n const [copied, setCopied] = useState(false);\n\n const id = uuid.replace(\"cipher-\", \"\");\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n return (\n <>\n \n \n Game ID: {id}\n window.location.reload()}\n title=\"Reload to get the latest cipher encoding\"\n style={{\n background: \"none\",\n border: \"1px solid #aaa\",\n borderRadius: \"4px\",\n cursor: \"pointer\",\n fontSize: \"1em\",\n lineHeight: \"1\",\n padding: \"1px 5px\",\n color: \"#555\",\n }}\n >\n ↻\n \n \n {!isMobileNative() && (\n <>\n

\n Competing against friends? Send them this link to solve the same\n problem:\n

\n \n \n \n {copied ? \"✓ Copied!\" : \"📋 Copy\"}\n \n \n \n )}\n \n );\n}\n",[348],"49464b82-1045-11f1-97d3-42dde27851f2","CipherModeSelector.tsx","463fbdee-1043-11f1-9c5b-42dde27851f2",["D",1771802519305],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\n\nexport const CIPHER_MODES = [\n { id: \"random\", label: \"Random Encryption\" },\n { id: \"caesar\", label: \"Caesar\" },\n { id: \"random_aristocrat\", label: \"Random Aristocrat\" },\n { id: \"k1_aristocrat\", label: \"K1 Aristocrat\" },\n { id: \"k2_aristocrat\", label: \"K2 Aristocrat\" },\n { id: \"k1_patristocrat\", label: \"K1 Patristocrat\" },\n { id: \"k2_patristocrat\", label: \"K2 Patristocrat\" },\n] as const;\n\nexport type CipherModeId = (typeof CIPHER_MODES)[number][\"id\"];\n\nexport function CipherModeSelector({\n selectedMode,\n onModeChange,\n}: {\n selectedMode: CipherModeId;\n onModeChange: (mode: CipherModeId) => void;\n}) {\n return (\n

\n \n {CIPHER_MODES.map((mode, index) => {\n const cipherLoaded = selectedMode !== \"random\";\n const isHeader = mode.id === \"random\" && cipherLoaded;\n const label = isHeader ? \"Change Encryption\" : mode.label;\n return (\n onModeChange(mode.id)}\n style={{\n padding: \"11px 10px\",\n backgroundColor: \"white\",\n cursor: isHeader ? \"default\" : \"pointer\",\n whiteSpace: \"nowrap\",\n borderBottom:\n index < CIPHER_MODES.length - 1 ? \"1px solid #e0e0e0\" : \"none\",\n color: isHeader\n ? \"#888\"\n : selectedMode === mode.id\n ? \"#1C50FF\"\n : \"#000\",\n fontWeight: !isHeader && selectedMode === mode.id ? \"bold\" : \"normal\",\n }}\n >\n {label}\n

\n );\n })}\n \n \n );\n}\n",[356],"62679f76-104a-11f1-bedb-42dde27851f2","App.tsx","d41a0f68-4422-11f0-89d5-76b3cceeab13",531,["D",1771804708959],78,"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport React, {\n createRef,\n useEffect,\n useRef,\n useState,\n} from \"https://esm.sh/react@18.2.0\";\nimport { AnotherRound } from \"./AnotherRound.tsx\";\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\nimport { getCipherName } from \"./cipherHelpers.ts\";\nimport { CipherModeSelector, type CipherModeId } from \"./CipherModeSelector.tsx\";\nimport {\n appendToLocalStorage,\n isTextKnown,\n present,\n startNewGame,\n} from \"./gameHelpers.ts\";\nimport { GameLink } from \"./GameLink.tsx\";\nimport { GameResult } from \"./GameResult.tsx\";\nimport { KnownTextWarning } from \"./KnownTextWarning.tsx\";\nimport { Loading } from \"./Loading.tsx\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\nimport { post } from \"./networkHelpers.ts\";\nimport { Notice } from \"./Notice.tsx\";\nimport { fetchQuote } from \"./quoteService.ts\";\nimport {\n randomSubstitutionMap,\n substitutionAndReverseMaps,\n substitutionEncode,\n} from \"./substitutionCipher.ts\";\nimport { generateHint, randomLetter } from \"./wordHelpers.ts\";\n\n// ── Cipher mode helpers ──────────────────────────────────────────────────────\n\nfunction getSelectedModeFromCipher(\n cipher: ReturnType\n): CipherModeId {\n if (\n cipher.type === \"k1\" &&\n cipher.keyword === \"\" &&\n cipher.groupingType === \"aristocrat\"\n )\n return \"caesar\";\n if (cipher.type === \"random\" && cipher.groupingType === \"aristocrat\")\n return \"random_aristocrat\";\n if (cipher.type === \"k1\" && cipher.groupingType === \"aristocrat\")\n return \"k1_aristocrat\";\n if (cipher.type === \"k2\" && cipher.groupingType === \"aristocrat\")\n return \"k2_aristocrat\";\n if (cipher.type === \"k1\" && cipher.groupingType === \"patristocrat\")\n return \"k1_patristocrat\";\n if (cipher.type === \"k2\" && cipher.groupingType === \"patristocrat\")\n return \"k2_patristocrat\";\n return \"random\";\n}\n\nfunction extractKeywordFromText(text: string): string {\n const words = text\n .toUpperCase()\n .replace(/[^A-Z ]/g, \" \")\n .split(/\\s+/)\n .filter(Boolean);\n const longWords = words.filter((w) => w.length >= 4);\n if (longWords.length > 0)\n return longWords[Math.floor(Math.random() * longWords.length)];\n return words[0] || \"WORD\";\n}\n\nfunction getModeParamsForMode(\n mode: CipherModeId,\n cipher: ReturnType\n): { type: \"k1\" | \"k2\" | \"random\"; groupingType: \"aristocrat\" | \"patristocrat\"; keyword: string } {\n const keyword =\n cipher.keyword && cipher.keyword.length >= 4\n ? cipher.keyword\n : extractKeywordFromText(cipher.original);\n switch (mode) {\n case \"caesar\":\n return { type: \"k1\", groupingType: \"aristocrat\", keyword: \"\" };\n case \"random_aristocrat\":\n return { type: \"random\", groupingType: \"aristocrat\", keyword: \"\" };\n case \"k1_aristocrat\":\n return { type: \"k1\", groupingType: \"aristocrat\", keyword };\n case \"k2_aristocrat\":\n return { type: \"k2\", groupingType: \"aristocrat\", keyword };\n case \"k1_patristocrat\":\n return { type: \"k1\", groupingType: \"patristocrat\", keyword };\n case \"k2_patristocrat\":\n return { type: \"k2\", groupingType: \"patristocrat\", keyword };\n default:\n return {\n type: cipher.type,\n groupingType: cipher.groupingType,\n keyword: cipher.keyword,\n };\n }\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n\nexport function App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [hardMode, setHardMode] = useState(\n localStorage.getItem(\"hardMode\") === \"true\"\n );\n const [cipher, setCipher] = useState | null>(null);\n const [originalQuote, setOriginalQuote] = useState(null);\n const [decryptionAttempt, setDecryptionAttempt] = useState([]);\n const [startTime, setStartTime] = useState(null);\n const [solveTime, setSolveTime] = useState(null);\n const [isCorrect, setIsCorrect] = useState(null);\n const [hintCount, setHintCount] = useState(0);\n const [keywordRevealed, setKeywordRevealed] = useState(false);\n const [quoteAuthor, setQuoteAuthor] = useState(null);\n const [isLoading, setIsLoading] = useState(true);\n const [loadingError, setLoadingError] = useState(\"\");\n const [isRevealed, setIsRevealed] = useState(false);\n const [currentFocusIndex, setCurrentFocusIndex] = useState(\n null\n );\n const inputRefs = useRef[]>([]);\n const [knownTexts, setKnownTexts] = useState([]);\n const [selectedCipherMode, setSelectedCipherMode] = useState(\"random\");\n // Ref so the loadGame closure can read the latest selection without a re-render dependency\n const selectedCipherModeRef = useRef(\"random\");\n\n const currentUrl = `${window.location.origin}/${uuid.replace(\"cipher-\", \"\")}`;\n // present(`uuid: ${uuid}, currentUrl: ${currentUrl} window.location.origin: ${window.location.origin}`);\n window.history.pushState({}, \"\", currentUrl);\n\n if (window.WebNativeBridge) {\n window.WebNativeBridge.nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function loadGame() {\n const result = await fetchQuote(uuid);\n\n setKnownTexts(result.knownTexts);\n\n if (result.error) {\n setLoadingError(result.error);\n setIsLoading(false);\n return;\n }\n\n if (result.cipher) {\n // Loading is done — now check if the user pre-selected a specific mode\n // while waiting. Apply it immediately (fast, client-side re-encode only).\n let finalCipher = result.cipher;\n const pendingMode = selectedCipherModeRef.current;\n if (pendingMode !== \"random\") {\n const loadedMode = getSelectedModeFromCipher(result.cipher);\n if (pendingMode !== loadedMode) {\n const { type, groupingType, keyword } = getModeParamsForMode(\n pendingMode,\n result.cipher\n );\n finalCipher = substitutionEncode({\n plainText: result.cipher.original,\n keyword,\n positionLetter: randomLetter(),\n type,\n groupingType,\n });\n if (groupingType === \"aristocrat\") {\n finalCipher.misspelledOriginal = misspellSentence(\n result.cipher.original\n );\n }\n // Background-save the new encoding so other users get the same mode\n if (uuid) {\n post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n value: { cipher: finalCipher, author: result.author },\n });\n }\n }\n }\n\n // Reflect the actual cipher mode in the selector\n const actualMode = getSelectedModeFromCipher(finalCipher);\n setSelectedCipherMode(actualMode);\n selectedCipherModeRef.current = actualMode;\n\n setCipher(finalCipher);\n setQuoteAuthor(result.author);\n // Store the original quote before any misspelling is applied\n setOriginalQuote(finalCipher.original);\n\n // Initialize decryption attempt with empty strings (only for letters)\n const lettersOnly = finalCipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input (only for letters)\n inputRefs.current = initialAttempt.map(() => createRef());\n }\n\n setIsLoading(false);\n }\n\n loadGame();\n }, []); // Only load once on mount\n\n // Add Enter key listener for submitting the game\n useEffect(() => {\n const handleKeyPress = (event: KeyboardEvent) => {\n // Only allow Enter to submit when game is active and not yet completed\n if (\n event.key === \"Enter\" &&\n startTime !== null &&\n !isRevealed &&\n !isCorrect\n ) {\n // Blur the active element to dismiss keyboard\n if (document.activeElement instanceof HTMLElement) {\n document.activeElement.blur();\n }\n handleSubmit();\n }\n };\n\n window.addEventListener(\"keydown\", handleKeyPress);\n return () => {\n window.removeEventListener(\"keydown\", handleKeyPress);\n };\n }, [startTime, isRevealed, isCorrect, decryptionAttempt]);\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n\n // Apply hard mode modifications\n if (hardMode && cipher) {\n if (cipher.groupingType === \"aristocrat\") {\n // For aristocrat: apply misspelling\n // Use pre-generated misspelled version if available (for consistency)\n // Otherwise generate on-the-fly (for backwards compatibility with old saved games)\n const misspelledText = cipher.misspelledOriginal || misspellSentence(cipher.original);\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: cipher.keyword,\n positionLetter: cipher.positionLetter,\n type: cipher.type,\n groupingType: cipher.groupingType,\n // IMPORTANT: Reuse the existing substitution map to ensure consistency\n // This prevents the bug where random type generates a new map\n existingSubstitutionMap: cipher.substitutionMap,\n existingReverseSubstitutionMap: cipher.reverseSubstitutionMap,\n // Pass through the misspelled version\n misspelledOriginal: cipher.misspelledOriginal,\n });\n setCipher(misspelledCipher);\n\n // Re-initialize decryption attempt with the misspelled cipher\n const lettersOnly = misspelledCipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n inputRefs.current = initialAttempt.map(() => createRef());\n } else if (cipher.groupingType === \"patristocrat\") {\n // For patristocrat: reduce hint from 4 letters to 2 letters\n const hintInfo = generateHint(cipher.original, 2);\n setCipher({\n ...cipher,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n });\n }\n }\n\n setStartTime(Date.now());\n };\n\n const handleModeChange = (mode: CipherModeId) => {\n selectedCipherModeRef.current = mode;\n setSelectedCipherMode(mode);\n\n // If cipher isn't loaded yet, the loadGame effect will apply the mode\n // once it finishes — no need to do anything here.\n if (!cipher || mode === \"random\") return;\n\n const currentMode = getSelectedModeFromCipher(cipher);\n if (mode === currentMode) return; // Already the requested mode\n\n // Re-encode client-side (fast — no network wait)\n const { type, groupingType, keyword } = getModeParamsForMode(mode, cipher);\n const newCipher = substitutionEncode({\n plainText: cipher.original,\n keyword,\n positionLetter: randomLetter(),\n type,\n groupingType,\n });\n if (groupingType === \"aristocrat\") {\n newCipher.misspelledOriginal = misspellSentence(cipher.original);\n }\n\n // Reset decryption attempt for the new encoding\n const lettersOnly = newCipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setCipher(newCipher);\n\n // Background-save so other users on the same link get the new mode too\n if (uuid) {\n post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n value: { cipher: newCipher, author: quoteAuthor },\n });\n }\n };\n\n const handleLetterChange = (letterIndex: number, value: string) => {\n if (!cipher) return;\n\n const newAttempt = [...decryptionAttempt];\n const uppercaseValue = value.toUpperCase();\n\n // If the value is a letter, autofill all matching encoded letters\n if (/^[A-Z]$/.test(uppercaseValue)) {\n newAttempt[letterIndex] = uppercaseValue;\n\n // Get the encoded letter at this letter-only index\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[letterIndex];\n\n // Find all indices of the same encoded letter and fill them\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > letterIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex(\n (letter) => letter === \"\"\n );\n if (\n firstUnfilledIndex !== -1 &&\n inputRefs.current[firstUnfilledIndex]?.current\n ) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (\n letterIndex: number,\n event: React.KeyboardEvent\n ) => {\n if (!cipher) return;\n\n // Handle letter key press - if field is already filled, clear it first to allow replacement\n if (/^[a-zA-Z]$/.test(event.key) && decryptionAttempt[letterIndex]) {\n event.preventDefault(); // Prevent default to handle manually\n \n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[letterIndex];\n const newAttempt = [...decryptionAttempt];\n const uppercaseValue = event.key.toUpperCase();\n \n // Clear all instances of the old letter first\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Now set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n \n setDecryptionAttempt(newAttempt);\n \n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > letterIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex(\n (letter) => letter === \"\"\n );\n if (\n firstUnfilledIndex !== -1 &&\n inputRefs.current[firstUnfilledIndex]?.current\n ) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n \n return; // Exit early since we handled the key press\n }\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[letterIndex]) {\n if (letterIndex > 0) {\n const prevIndex = letterIndex - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedLettersOnly[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, idx) =>\n encodedLettersOnly[idx] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(updatedAttempt);\n\n // Focus the previous input\n inputRefs.current[prevIndex].current?.focus();\n }\n } else {\n // If current input is not empty, clear all instances of its letter\n const encodedLetterToRemove = encodedLettersOnly[letterIndex];\n const newAttempt = decryptionAttempt.map((letter, idx) =>\n encodedLettersOnly[idx] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[letterIndex].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n // Only create entries for letters (not punctuation)\n const lettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) {\n return;\n }\n\n // if there is empty letter in decryptionAttempt, return\n if (decryptionAttempt.some((letter) => letter === \"\")) {\n present(\"😾 Not completed yet\");\n return;\n }\n if (cipher) {\n // Remove spaces from the encoded message to match decryption attempt\n const cleanEncoded = cipher.encoded.replace(/\\s/g, \"\");\n\n // Translate the decryption attempt back to original letters\n const translatedAttempt = decryptionAttempt.join(\"\");\n const isMatch = translatedAttempt === cipher.cleanOriginal;\n\n setIsCorrect(isMatch);\n\n if (isMatch && startTime) {\n const timeTaken = Math.round((Date.now() - startTime) / 1000);\n setSolveTime(timeTaken);\n\n // Use the original quote (before misspelling) for saving\n appendToLocalStorage(originalQuote || cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await post(\"https://simplevalueapi.val.run/addLog\", {\n id: uuid,\n log: `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n });\n void sendBridgeMessage({\n action: \"finish\",\n data: {\n uuid,\n success: true,\n timeTaken,\n hintCount,\n keywordRevealed,\n hardMode,\n },\n });\n }\n }\n if (!isMatch && uuid && name) {\n await post(\"https://simplevalueapi.val.run/addLog\", {\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) {\n return;\n }\n if (cipher && startTime) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n const timeTaken = Math.round((Date.now() - startTime) / 1000);\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n // Use the original quote (before misspelling) for saving\n appendToLocalStorage(originalQuote || cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await post(\n \"https://simplevalueapi.val.run/addLog\",\n {\n id: uuid,\n log: `💀 ${name} abandoned the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n }\n );\n void sendBridgeMessage({\n action: \"finish\",\n data: {\n uuid,\n success: false,\n timeTaken,\n hintCount,\n keywordRevealed,\n hardMode,\n },\n });\n }\n }\n };\n\n const handleRevealKeyword = () => {\n if (cipher) {\n if (cipher.type === \"random\") {\n present(\"It's a random substitution cipher. There is no keyword.\");\n } else if (\n cipher.type === \"k1\" &&\n cipher.keyword === \"\" &&\n cipher.groupingType === \"aristocrat\"\n ) {\n const shift = cipher.positionLetter.charCodeAt(0) - 65;\n present(`It's a Caesar cipher with shift ${shift}`);\n setKeywordRevealed(true);\n } else {\n present(`The keyword is ${cipher.keyword}`);\n setKeywordRevealed(true);\n }\n }\n };\n\n const handleRevealAuthor = () => {\n if (quoteAuthor) {\n present(`The author is ${quoteAuthor}`);\n } else {\n present(`No author for this`);\n }\n };\n\n const handleHintType = () => {\n if (isCorrect || isRevealed) {\n return;\n }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[currentFocusIndex];\n const originalLetter =\n Object.entries(cipher.reverseSubstitutionMap).find(\n ([encoded]) => encoded === encodedLetter\n )?.[1] || \"\";\n\n if (originalLetter) {\n const newAttempt = [...decryptionAttempt];\n newAttempt[currentFocusIndex] = originalLetter;\n\n // Fill all matching encoded letters\n decryptionAttempt.forEach((letter, idx) => {\n if (encodedLettersOnly[idx] === encodedLetter) {\n newAttempt[idx] = originalLetter;\n }\n });\n\n setDecryptionAttempt(newAttempt);\n setHintCount(hintCount + 1);\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > currentFocusIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (\n encodedLettersOnly[index] === encodedLetter &&\n decryptionAttempt[index] !== \"\"\n ) {\n attemptForLetter = decryptionAttempt[index];\n break;\n }\n }\n for (const index in decryptionAttempt) {\n // if another encoded letter also uses attemptForLetter\n if (\n decryptionAttempt[index] !== \"\" &&\n encodedLettersOnly[index] !== encodedLetter &&\n decryptionAttempt[index] === attemptForLetter\n ) {\n return true;\n }\n }\n return false;\n };\n\n const attemptedOriginalFor = (encodedLetter: string) => {\n if (!cipher) return \"\";\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n for (const index in decryptionAttempt) {\n if (\n encodedLettersOnly[index] === encodedLetter &&\n decryptionAttempt[index] !== \"\"\n ) {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedLettersOnly[index];\n }\n }\n return \"?\";\n };\n\n // Helper: Get the visual position (including punctuation) in the encoded string\n const visualIndexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(/\\s+/); // Split by all whitespace (spaces, newlines, tabs)\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n // Helper: Convert visual position to letter-only index in decryptionAttempt\n const letterIndexFromVisual = (visualIndex: number): number => {\n if (!cipher) return 0;\n const encodedWithoutSpaces = cipher.encoded.replace(/\\s/g, \"\");\n let letterCount = 0;\n for (let i = 0; i < visualIndex && i < encodedWithoutSpaces.length; i++) {\n if (/[A-Z]/.test(encodedWithoutSpaces[i])) {\n letterCount++;\n }\n }\n return letterCount;\n };\n\n // Helper: Check if a character at visual position is a letter\n const isLetterAtVisual = (\n groupIndex: number,\n indexInGroup: number\n ): boolean => {\n if (!cipher) return false;\n const words = cipher.encoded.split(/\\s+/); // Split by all whitespace (spaces, newlines, tabs)\n if (groupIndex >= words.length) return false;\n const char = words[groupIndex][indexInGroup];\n return /[A-Z]/.test(char);\n };\n\n return (\n <>\n \n {isLoading ? (\n <>\n \n \n \n \n \n ) : !cipher ? (\n

\n {`Something unexpected happened: ${loadingError}`}\n

\n ) : (\n \n {!isMobileNative() && (\n

\n Cipher Challenge 🕵️\n

\n )}\n\n {cipher &&\n startTime === null &&\n isTextKnown(cipher.original, quoteAuthor, knownTexts) && (\n \n )}\n\n {startTime !== null && (\n

\n \n \n \n {cipher.encoded.split(/\\s+/).map((group, groupIndex) => (\n \n \n {group.split(\"\").map((char, charIndex) => {\n const isLetter = /[A-Z]/.test(char);\n return (\n \n {char}\n {isLetter && (\n \n {cipher?.encodedLetterCounts[\n char\n ].toString() ?? \"\"}\n \n )}\n

\n );\n })}\n \n \n {group.split(\"\").map((char, charIndex) => {\n const isLetter = isLetterAtVisual(\n groupIndex,\n charIndex\n );\n const visualIdx = visualIndexFor(\n groupIndex,\n charIndex\n );\n const letterIdx = letterIndexFromVisual(visualIdx);\n\n if (!isLetter) {\n // Render punctuation/non-letter as plain text\n return (\n \n {char}\n \n );\n }\n\n // Render input for letters\n return (\n \n handleLetterChange(letterIdx, e.target.value)\n }\n onKeyDown={(e) => handleKeyDown(letterIdx, e)}\n onFocus={() => setCurrentFocusIndex(letterIdx)}\n style={{\n width: \"var(--char-width)\",\n height: \"var(--char-height)\",\n textAlign: \"center\",\n textTransform: \"uppercase\",\n backgroundColor: \"#e0e0e0\",\n fontSize: \"var(--font-size-base)\",\n padding: \"0\",\n border: \"1px solid #ccc\",\n boxSizing: \"border-box\",\n lineHeight: \"normal\",\n verticalAlign: \"middle\",\n }}\n />\n );\n })}\n \n \n ))}\n \n \n \n\n {cipher.hint && (\n \n {cipher.hintSource === \"first\"\n ? \"Beginning of the quote\"\n : \"End of the quote\"}\n : {cipher.hint}\n \n )}\n\n

\n \n {getCipherName(\n cipher.type,\n cipher.keyword,\n cipher.groupingType\n )}\n {\" \"}\n → original:\n
\n {cipher.type !== \"k2\"\n ? \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n {letter}\n \n {cipher.encodedLetterCounts[letter] ?? 0}\n \n {\"→\"}\n \n {attemptedOriginalFor(letter)}\n \n \n \n ))\n : \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n \n {attemptedEncodedFor(letter)}\n \n {\"→\"}\n {letter}\n \n \n ))}\n

\n\n {cipher.type === \"k2\" && (\n

\n Cipher letter frequency:\n
\n {\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n {letter}\n {\":\"}\n \n {cipher?.encodedLetterCounts[letter] ?? 0}\n \n \n \n ))}\n

\n )}\n\n {!isMobileNative() && (\n

\n Codebreaker: {name ?? \"\"}\n

\n )}\n \n \n Submit Decryption\n \n \n Clear\n \n \n\n {isCorrect !== null && !isRevealed && (\n \n {isCorrect ? (\n <>\n 🎉 Correct! You solved the cipher in {solveTime} seconds\n with {hintCount} hints and{\" \"}\n {keywordRevealed\n ? \"with the help of the keyword\"\n : \"without peeking the keyword\"}\n .\n
\n Original Quote: \"{originalQuote || cipher.original}\"\n {quoteAuthor && (\n \n Quote by: {quoteAuthor}\n \n )}\n \n ) : (\n \"Incorrect. Try again! 🤔\"\n )}\n \n )}\n \n )}\n\n {startTime === null && (\n

\n \n \n \n setName(e.target.value)}\n type=\"text\"\n />\n \n START\n \n

\n \n \n {\n const newHardMode = e.target.checked;\n setHardMode(newHardMode);\n localStorage.setItem(\"hardMode\", String(newHardMode));\n }}\n style={{\n width: \"20px\",\n height: \"20px\",\n cursor: \"pointer\",\n }}\n />\n Hard Mode\n \n (\n present(\n \"Hard Mode:\\nIf it's an Aristocrat, some misspellings will be introduced.\\nIf it's a Patristocrat, the hint is reduced.\"\n )\n }\n style={{\n color: \"gray\",\n textDecoration: \"none\",\n cursor: \"pointer\",\n }}\n >\n What is it?\n )\n \n \n )}\n\n \n {!(isMobileNative() && !startTime) && ( // if it's mobile native, don't show game results in the waiting page\n \n )}\n \n\n {startTime !== null && (\n \n \n Reveal Author\n \n \n Reveal Current Letter\n \n \n Reveal Keyword\n \n \n Reveal Entire Answer\n \n \n )}\n\n {isRevealed && (\n \n 🚨 Answer Revealed! Better luck next time. 🚨\n \n )}\n \n )}\n \n );\n}\n",[362],"56e3acc2-ad3e-11f0-a058-0224a6c84d84","App.test.ts","56e3ad8a-ad3e-11f0-a058-0224a6c84d84",510,["D",1760914370552],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\n\n/**\n * Test for the letter filling bug fix in App.tsx\n *\n * Bug Description:\n * When cipher.encoded contains newlines, splitting by space only (\" \")\n * causes newlines to remain in words, leading to misalignment between\n * visual indices and letter indices. This caused incorrect letter filling.\n *\n * Fix:\n * Changed all instances of .split(\" \") to .split(/\\s+/) to properly\n * split by all whitespace characters (spaces, newlines, tabs).\n */\n\nDeno.test(\n \"visualIndexFor handles newlines correctly (bug from game 794496)\",\n () => {\n // Real scenario from the bug report\n const encoded = \"DBEQ,\\nNXP LD WECD\";\n\n // Fixed implementation\n const visualIndexFor = (\n groupIndex: number,\n indexInGroup: number\n ): number => {\n let index = 0;\n let words = encoded.split(/\\s+/); // Split by all whitespace\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n const letterIndexFromVisual = (visualIndex: number): number => {\n const encodedWithoutSpaces = encoded.replace(/\\s/g, \"\");\n let letterCount = 0;\n for (let i = 0; i < visualIndex && i < encodedWithoutSpaces.length; i++) {\n if (/[A-Z]/.test(encodedWithoutSpaces[i])) {\n letterCount++;\n }\n }\n return letterCount;\n };\n\n const isLetterAtVisual = (\n groupIndex: number,\n indexInGroup: number\n ): boolean => {\n const words = encoded.split(/\\s+/); // Split by all whitespace\n if (groupIndex >= words.length) return false;\n const char = words[groupIndex][indexInGroup];\n return /[A-Z]/.test(char);\n };\n\n const encodedLettersOnly = encoded.replace(/[^A-Z]/g, \"\");\n const words = encoded.split(/\\s+/);\n\n // Test all letter positions\n let allCorrect = true;\n words.forEach((group, groupIndex) => {\n group.split(\"\").forEach((char, charIndex) => {\n const isLetter = isLetterAtVisual(groupIndex, charIndex);\n if (isLetter) {\n const visualIdx = visualIndexFor(groupIndex, charIndex);\n const letterIdx = letterIndexFromVisual(visualIdx);\n const actualLetter = encodedLettersOnly[letterIdx];\n\n if (char !== actualLetter) {\n console.error(\n `Mismatch at group ${groupIndex}, char ${charIndex}: ` +\n `expected '${char}', got '${actualLetter}'`\n );\n allCorrect = false;\n }\n }\n });\n });\n\n assertEquals(allCorrect, true, \"All letters should match their indices\");\n }\n);\n\nDeno.test(\"letter filling works correctly across newlines\", () => {\n const encoded = \"ABC,\\nDEF GHI\";\n const encodedLettersOnly = encoded.replace(/[^A-Z]/g, \"\"); // \"ABCDEFGHI\"\n\n // Simulate filling letter 'D' (index 3) with 'X'\n const decryptionAttempt = encodedLettersOnly.split(\"\").map(() => \"\");\n const letterToFill = 3; // Position of 'D' in \"ABCDEFGHI\"\n const valueToFill = \"X\";\n const encodedLetter = encodedLettersOnly[letterToFill]; // 'D'\n\n // Fill all positions where the encoded letter matches\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n decryptionAttempt[idx] = valueToFill;\n }\n });\n\n // Only position 3 should be filled (only one 'D' in the string)\n assertEquals(decryptionAttempt[3], \"X\");\n assertEquals(decryptionAttempt[0], \"\"); // 'A' should not be filled\n assertEquals(decryptionAttempt[4], \"\"); // 'E' should not be filled\n});\n\nDeno.test(\n \"whitespace splitting works for various whitespace characters\",\n () => {\n const testCases = [\n { input: \"ABC DEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC\\nDEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC\\tDEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC \\n\\n DEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC,\\nDEF GHI\", expected: [\"ABC,\", \"DEF\", \"GHI\"] },\n ];\n\n testCases.forEach(({ input, expected }) => {\n const result = input.split(/\\s+/);\n assertEquals(\n result,\n expected,\n `Failed for input: ${JSON.stringify(input)}`\n );\n });\n }\n);\n",[370],"f8d1cbba-a71f-11f0-bd90-0224a6c84d84","AnotherRound.tsx","7e3ca574-442c-11f0-8338-76b3cceeab13",["D",1760241620865],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative } from \"./bridge.ts\";\nimport { startNewGame } from \"./gameHelpers.ts\";\n\nexport function AnotherRound({ uuid }: { uuid: string }) {\n return (\n !isMobileNative() && (\n <>\n \n \n {\n startNewGame(uuid);\n }}\n style={{\n padding: \"10pt\",\n backgroundColor: \"#3572fa\",\n color: \"white\",\n border: \"none\",\n flex: 0.3,\n fontSize: \"var(--font-size-button)\",\n }}\n >\n Another Round\n \n

\n If your friends are on the same link, you can all tap this button to\n compete on a same puzzle again.\n

\n \n \n )\n );\n}\n",[377],"ce832b6c-0ac3-11f1-a72d-42dde27851f2",".vtignore","2975a784-a6e7-11f0-a077-0224a6c84d84",["D",1771197152424],"# don't ignore anything",[383],"2975f0b8-a6e7-11f0-a077-0224a6c84d84",".vscode","0199d51f-481c-713b-a192-42ecc85f9123",["D",1760217221145],"directory",[389],"d7161b26-1050-11f1-8238-42dde27851f2",".claude","019c87f4-9f5d-70e6-9200-d0860d53c739",532,["D",1771807481696],[395],"pulls","branches","forks","envVars",{"_407":63,"_409":63},"connections",{"_407":63,"_408":63},"count","unfilledCount","emptyCount",{"_43":394,"_32":395,"_30":396,"_164":-5,"_41":42,"_40":397,"_166":49,"_38":560,"_13":63,"_33":392,"_35":-5,"_24":25,"_170":-5,"_447":561,"_27":562},{"_43":553,"_32":554,"_30":555,"_164":396,"_41":42,"_40":397,"_166":49,"_38":556,"_13":63,"_33":20,"_35":557,"_24":25,"_170":-5,"_447":558,"_27":559},{"_43":388,"_32":389,"_30":390,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":550,"_13":63,"_33":392,"_35":-5,"_24":25,"_170":-5,"_447":551,"_27":552},{"_43":543,"_32":544,"_30":545,"_164":390,"_41":42,"_40":186,"_166":49,"_38":546,"_13":63,"_33":20,"_35":547,"_24":25,"_170":-5,"_447":548,"_27":549},{"_43":382,"_32":383,"_30":384,"_164":-5,"_41":42,"_40":301,"_166":49,"_38":540,"_13":225,"_33":20,"_35":386,"_24":25,"_170":-5,"_447":541,"_27":542},{"_43":376,"_32":377,"_30":378,"_164":-5,"_41":42,"_40":328,"_166":25,"_38":537,"_13":295,"_33":34,"_35":380,"_24":25,"_170":-5,"_447":538,"_27":539},{"_43":369,"_32":370,"_30":371,"_164":-5,"_41":42,"_40":372,"_166":49,"_38":534,"_13":63,"_33":34,"_35":374,"_24":25,"_170":-5,"_447":535,"_27":536},{"_43":361,"_32":362,"_30":363,"_164":-5,"_41":42,"_40":364,"_166":25,"_38":531,"_13":366,"_33":34,"_35":367,"_24":25,"_170":-5,"_447":532,"_27":533},{"_43":355,"_32":356,"_30":357,"_164":-5,"_41":42,"_40":320,"_166":49,"_38":528,"_13":210,"_33":34,"_35":359,"_24":25,"_170":-5,"_447":529,"_27":530},{"_43":347,"_32":348,"_30":349,"_164":-5,"_41":42,"_40":350,"_166":49,"_38":525,"_13":352,"_33":34,"_35":353,"_24":25,"_170":-5,"_447":526,"_27":527},{"_43":340,"_32":341,"_30":342,"_164":-5,"_41":42,"_40":343,"_166":49,"_38":522,"_13":210,"_33":34,"_35":345,"_24":25,"_170":-5,"_447":523,"_27":524},{"_43":333,"_32":334,"_30":335,"_164":-5,"_41":42,"_40":336,"_166":49,"_38":519,"_13":202,"_33":34,"_35":338,"_24":25,"_170":-5,"_447":520,"_27":521},{"_43":325,"_32":326,"_30":327,"_164":-5,"_41":42,"_40":328,"_166":49,"_38":516,"_13":330,"_33":34,"_35":331,"_24":25,"_170":-5,"_447":517,"_27":518},{"_43":317,"_32":318,"_30":319,"_164":-5,"_41":42,"_40":320,"_166":49,"_38":513,"_13":322,"_33":34,"_35":323,"_24":25,"_170":-5,"_447":514,"_27":515},{"_43":311,"_32":312,"_30":313,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":510,"_13":63,"_33":20,"_35":315,"_24":25,"_170":-5,"_447":511,"_27":512},{"_43":305,"_32":306,"_30":307,"_164":-5,"_41":42,"_40":210,"_166":49,"_38":507,"_13":63,"_33":20,"_35":309,"_24":25,"_170":-5,"_447":508,"_27":509},{"_43":298,"_32":299,"_30":300,"_164":-5,"_41":42,"_40":301,"_166":49,"_38":504,"_13":63,"_33":34,"_35":303,"_24":25,"_170":-5,"_447":505,"_27":506},{"_43":290,"_32":291,"_30":292,"_164":-5,"_41":42,"_40":293,"_166":49,"_38":501,"_13":295,"_33":34,"_35":296,"_24":25,"_170":-5,"_447":502,"_27":503},{"_43":284,"_32":285,"_30":286,"_164":-5,"_41":42,"_40":246,"_166":49,"_38":498,"_13":210,"_33":34,"_35":288,"_24":25,"_170":-5,"_447":499,"_27":500},{"_43":278,"_32":279,"_30":280,"_164":-5,"_41":42,"_40":193,"_166":49,"_38":495,"_13":210,"_33":34,"_35":282,"_24":25,"_170":-5,"_447":496,"_27":497},{"_43":271,"_32":272,"_30":273,"_164":-5,"_41":42,"_40":274,"_166":49,"_38":492,"_13":210,"_33":34,"_35":276,"_24":25,"_170":-5,"_447":493,"_27":494},{"_43":263,"_32":264,"_30":265,"_164":-5,"_41":42,"_40":266,"_166":25,"_38":489,"_13":268,"_33":34,"_35":269,"_24":25,"_170":-5,"_447":490,"_27":491},{"_43":256,"_32":257,"_30":258,"_164":-5,"_41":42,"_40":259,"_166":25,"_38":486,"_13":63,"_33":34,"_35":261,"_24":25,"_170":-5,"_447":487,"_27":488},{"_43":250,"_32":251,"_30":252,"_164":-5,"_41":42,"_40":200,"_166":49,"_38":483,"_13":210,"_33":34,"_35":254,"_24":25,"_170":-5,"_447":484,"_27":485},{"_43":243,"_32":244,"_30":245,"_164":-5,"_41":42,"_40":246,"_166":49,"_38":480,"_13":63,"_33":34,"_35":248,"_24":25,"_170":-5,"_447":481,"_27":482},{"_43":234,"_32":235,"_30":57,"_164":-5,"_41":42,"_40":236,"_166":49,"_38":477,"_13":238,"_33":239,"_35":240,"_24":25,"_170":241,"_447":478,"_27":479},{"_43":228,"_32":229,"_30":230,"_164":-5,"_41":42,"_40":165,"_166":49,"_38":474,"_13":202,"_33":34,"_35":232,"_24":25,"_170":-5,"_447":475,"_27":476},{"_43":220,"_32":221,"_30":222,"_164":-5,"_41":42,"_40":223,"_166":49,"_38":471,"_13":225,"_33":34,"_35":226,"_24":25,"_170":-5,"_447":472,"_27":473},{"_43":213,"_32":214,"_30":215,"_164":-5,"_41":42,"_40":216,"_166":49,"_38":468,"_13":63,"_33":34,"_35":218,"_24":25,"_170":-5,"_447":469,"_27":470},{"_43":205,"_32":206,"_30":207,"_164":-5,"_41":42,"_40":208,"_166":49,"_38":465,"_13":210,"_33":34,"_35":211,"_24":25,"_170":-5,"_447":466,"_27":467},{"_43":197,"_32":198,"_30":199,"_164":-5,"_41":42,"_40":200,"_166":49,"_38":462,"_13":202,"_33":34,"_35":203,"_24":25,"_170":-5,"_447":463,"_27":464},{"_43":190,"_32":191,"_30":192,"_164":-5,"_41":42,"_40":193,"_166":49,"_38":459,"_13":63,"_33":20,"_35":195,"_24":25,"_170":-5,"_447":460,"_27":461},{"_43":183,"_32":184,"_30":185,"_164":-5,"_41":42,"_40":186,"_166":49,"_38":456,"_13":63,"_33":34,"_35":188,"_24":25,"_170":-5,"_447":457,"_27":458},{"_43":179,"_32":28,"_30":31,"_164":-5,"_41":42,"_40":14,"_166":49,"_38":453,"_13":181,"_33":34,"_35":37,"_24":25,"_170":-5,"_447":454,"_27":455},{"_43":172,"_32":173,"_30":174,"_164":-5,"_41":42,"_40":175,"_166":49,"_38":450,"_13":63,"_33":34,"_35":177,"_24":25,"_170":-5,"_447":451,"_27":452},{"_43":161,"_32":162,"_30":163,"_164":-5,"_41":42,"_40":165,"_166":49,"_38":446,"_13":168,"_33":34,"_35":169,"_24":25,"_170":-5,"_447":448,"_27":449},["D",1763229308190],"children",[],[162],["D",1763001991791],[],[173],["D",1774143132812],[],[28],["D",1760217221145],[],[184],["D",1760293230598],[],[191],["D",1766904321471],[],[198],["D",1762016258186],[],[206],["D",1749418805397],[],[214],["D",1750634621433],[],[221],["D",1763229308190],[],[229],["D",1763858833829],[],[235],["D",1766775142106],[],[244],["D",1766904321471],[],[251],["D",1749357682642],[],[257],["D",1774122260147],[],[264],["D",1760242229389],[],[272],["D",1760293230598],[],[279],["D",1766775142106],[],[285],["D",1760768921885],[],[291],["D",1771197152424],[],[299],["D",1735608699289],[],[306],["D",1760217221145],[],[312],["D",1771802519305],[],[318],["D",1760241620865],[],[326],["D",1749434757648],[],[334],["D",1749434769089],[],[341],["D",1771801655240],[],[348],["D",1771802519305],[],[356],["D",1771804708959],[],[362],["D",1760914370552],[],[370],["D",1760241620865],[],[377],["D",1771197152424],[],[383],"2975a590-a6e7-11f0-a077-0224a6c84d84","extensions.json","2975a5f4-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"{\n \"recommendations\": [\n \"denoland.vscode-deno\"\n ]\n}",[],[389,544],["D",1760217221145],[413],[389],"d7161266-1050-11f1-8238-42dde27851f2","settings.json","d716131a-1050-11f1-8238-42dde27851f2",["D",1771807481696],"{\n \"permissions\": {\n \"allow\": [\n \"Bash(node ./analyze_quote.js:*)\",\n \"Bash(node:*)\",\n \"Bash(python3:*)\"\n ]\n }\n}\n",[],[395,554],["D",1771807481696],[411],[395],["D",1746217506027],{"_97":96,"_104":100},{"_97":96,"_98":-5,"_99":100,"_18":55,"_101":102,"_103":25},{"_13":86,"_32":87,"_43":42,"_88":44,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":-5,"_94":45,"_95":96},"ctx",{"_79":-5,"_124":600,"_601":602,"_603":604,"_605":25,"_606":25,"_607":25,"_608":49,"_609":-5,"_610":-7,"_611":-7,"_612":63,"_613":25,"_614":25,"_615":-5,"_616":25,"_617":25,"_618":25,"_619":-5},"ENV",{"_571":572,"_573":574,"_575":87,"_576":577,"_578":579,"_580":581,"_582":583,"_584":585,"_586":587,"_588":589,"_590":591,"_592":593,"_594":595,"_596":597,"_598":599},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","e87eb04e707cf64e7e532c8e8ec395f209e17f15","RENDER_GIT_BRANCH","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","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

Diff · v535