Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

\n {!isMobileNative()\n ? (\n {\n setKnownTextsShown(!knownTextsShown);\n }}\n style={{\n marginTop: \"5px\",\n padding: \"10px\",\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: \"5px\",\n padding: \"10px\",\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\n {startTime !== null\n && (\n

\n \n \n \n {cipher.encoded.split(\" \").map((group, groupIndex) => (\n \n \n {group.split(\"\").map((letter, letterIndex) => (\n \n {letter}\n \n {cipher?.encodedLetterCounts[letter].toString() ?? \"\"}\n \n

\n ))}\n \n \n {group.split(\"\").map((letter, letterIndex) => (\n handleLetterChange(indexFor(groupIndex, letterIndex), e.target.value)}\n onKeyDown={(e) => handleKeyDown(indexFor(groupIndex, letterIndex), e)}\n onFocus={() => setCurrentFocusIndex(indexFor(groupIndex, letterIndex))}\n style={{\n width: \"26px\",\n height: \"30px\",\n textAlign: \"center\",\n textTransform: \"uppercase\",\n backgroundColor: letter === \" \" ? \"transparent\" : \"#e0e0e0\",\n }}\n disabled={letter === \" \"}\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\"}: {cipher.hint}\n \n )}\n\n

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

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

\n Cipher letter frequency:\n
\n {\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\").map((letter, index) => (\n \n {letter}\n {\":\"}\n {cipher?.encodedLetterCounts[letter] ?? 0}\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 <>\n 🎉 Correct! You solved the cipher in {solveTime} seconds with {hintCount} hints and{\" \"}\n {keywordRevealed ? \"with the help of the keyword\" : \"without peeking the keyword\"}.\n
\n Original Quote: \"{cipher.original}\"\n\n {quoteAuthor && (\n \n Quote by: {quoteAuthor}\n \n )}\n \n )\n : (\n \"Incorrect. Try again! 🤔\"\n )}\n \n )}\n \n )}\n\n {startTime === null && (\n

\n \n

\n URGENT NOTICE\n

\n
\n We’ve intercepted an enemy telegraph brimming with top-secret plans that could turn the tide of the war.\n
\n
\n Your mission is to crack the cipher and extract its secrets before the enemy strikes. Lives depend on your\n speed and precision -- time is running out.\n
\n
\n {cipher && (\n

\n We believe the message is encrypted with {cipher.type} {cipher.type === \"random\" ? \"substitution \" : \"\"}\n {cipher.groupingType}. Learn more about the cipher at{\" \"}\n void sendBridgeMessage({ action: \"openLink\", data: { url: tutorialUrl } })}\n >\n this location\n .\n

\n )}\n

\n \n setName(e.target.value)}\n type=\"text\"\n />\n \n START\n \n \n \n )}\n\n {!isMobileNative() && (\n <>\n \n Competing against friends? Send them this link to solve the same problem:\n \n \n \n \n {copied ? \"✓ Copied!\" : \"📋 Copy\"}\n \n \n \n )}\n {!(isMobileNative() && !startTime) // if it's mobile native, don't show game results in the waiting page\n && (\n \n See{\" \"}\n {\n void sendBridgeMessage({ action: \"openLink\", data: { url: resultUrl } });\n }}\n >\n Game Result\n \n \n )}\n {!isMobileNative()\n && (\n \n {\n startNewGame(uuid);\n }}\n style={{\n padding: \"10px\",\n backgroundColor: \"#3572fa\",\n color: \"white\",\n border: \"none\",\n flex: 0.3,\n }}\n >\n Another Round\n \n

\n If your friends are on the same link, you can all tap this button to compete on a same puzzle again.\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\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\") { client(); }\n\nexport default async function server(request: Request): Promise {\n const requestPath = new URL(request.url).pathname;\n if (requestPath === \"/quote\") {\n const pageId = (new URL(request.url).searchParams.get(\"pageId\"))\n ?? Math.floor(Math.random() * quoteCount + 1).toString();\n const pageIdInt = parseInt(pageId);\n console.log(\"Page ID:\", pageIdInt);\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 // Use database query with filter instead of direct page fetch\n const response = await fetch(`https://api.notion.com/v1/databases/${databaseId}/query`, {\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: pageIdInt + 3, // load a few more to make sure we have one that's long enough\n },\n },\n {\n property: \"ID\", // Uppercase ID property\n unique_id: {\n greater_than_or_equal_to: Math.max(1, pageIdInt - 1), // load a few more to make sure we have one that's long enough\n },\n },\n ],\n },\n sorts: [\n {\n \"property\": \"ID\",\n \"direction\": \"ascending\",\n },\n ],\n }),\n });\n // console.log(response);\n\n if (!response.ok) {\n throw new Error(`Failed to query Notion database: ${response.statusText}`);\n }\n\n const data = await response.json();\n\n let keyword = \"\";\n console.log(`Fetched ${data.results.length} pages from Notion API:`);\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(JSON.stringify({ quote, author, keyword, quoteId }), {\n headers: { \"Content-Type\": \"application/json\" },\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\n let paramUuid: string | undefined;\n let match = requestPath.match(/\\/(\\d+)/);\n if (match && parseInt(match[1]) >= 0) {\n paramUuid = \"cipher-\" + match[1];\n console.log(\"paramUuid:\", paramUuid);\n }\n else {\n const url = new URL(request.url);\n paramUuid = url.searchParams.get(\"id\");\n if (!paramUuid) {\n let randonNum = Math.round(Math.random() * 1000000);\n paramUuid = `cipher-${randonNum}`;\n }\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 headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}","bao-cipher",[],[164],"files",[142,162],"counts",{"_176":31,"_177":150,"_178":31,"_179":31},"pulls","branches","forks","envVars","contents",[182,185],{"_102":143,"_95":144,"_145":146,"_147":-5,"_148":134,"_149":150,"_151":108,"_104":183,"_99":31,"_153":154,"_155":156,"_157":27,"_158":-5,"_98":184},["D",1735608699289],[144],{"_102":163,"_95":164,"_145":115,"_147":-5,"_148":134,"_149":118,"_151":108,"_104":186,"_99":166,"_153":167,"_155":168,"_157":27,"_158":169,"_98":187},["D",1748324381563],[164],"upstream","emptyEnvVars","isNew","routes/_app.x.$handle.$name.branch.$branch.history",{"_93":94,"_95":96,"_97":41,"_100":193,"_197":198,"_452":31,"_453":108},{"_102":103,"_95":96,"_104":194,"_106":-5,"_107":108,"_109":110,"_111":-5,"_112":-5,"_12":113,"_114":115,"_116":108,"_117":118,"_119":31,"_120":121,"_122":121,"_123":124,"_125":124,"_126":124,"_127":121,"_128":27,"_21":195,"_132":196},["D",1746217506027],{"_93":94,"_130":131},{"_99":118,"_95":41,"_102":134,"_135":103,"_136":-5,"_137":-5,"_138":-5,"_139":-5},"history",[199,204,212,220,228,236,244,252,260,268,276,284,292,300,308,316,324,332,340,348,356,364,372,380,388,396,404,412,420,428,436,444],{"_145":115,"_99":118,"_104":200,"_148":134,"_172":201},["D",1748324381563],[202],{"_102":163,"_148":134,"_145":115,"_95":164,"_155":168,"_153":167,"_99":166,"_147":-5,"_104":200,"_149":118,"_158":169,"_151":108,"_157":27,"_98":203},[164],{"_145":115,"_99":166,"_104":205,"_148":134,"_172":206},["D",1748324104589],[207],{"_102":208,"_148":134,"_145":115,"_95":164,"_155":209,"_153":167,"_99":210,"_147":-5,"_104":205,"_149":166,"_158":169,"_151":27,"_157":27,"_98":211},"5792e15a-3abc-11f0-98f1-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://simplevalueapi.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n void sendBridgeMessage({ action: \"solved\", data: { time: timeTaken, hintCount, keywordRevealed } });\n\n if (uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",375,[164],{"_145":115,"_99":210,"_104":213,"_148":134,"_172":214},["D",1748324080539],[215],{"_102":216,"_148":134,"_145":115,"_95":164,"_155":217,"_153":167,"_99":218,"_147":-5,"_104":213,"_149":210,"_158":169,"_151":27,"_157":27,"_98":219},"493c8e12-3abc-11f0-9c71-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://simplevalueapi.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n sendBridgeMessage({ action: \"solved\", time: timeTaken, hintCount, keywordRevealed });\n\n if (uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",374,[164],{"_145":115,"_99":218,"_104":221,"_148":134,"_172":222},["D",1748323769015],[223],{"_102":224,"_148":134,"_145":115,"_95":164,"_155":225,"_153":167,"_99":226,"_147":-5,"_104":221,"_149":218,"_158":169,"_151":27,"_157":27,"_98":227},"8f8e67ce-3abb-11f0-8483-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://simplevalueapi.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://simplevalueapi.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",373,[164],{"_145":115,"_99":226,"_104":229,"_148":134,"_172":230},["D",1748323577226],[231],{"_102":232,"_148":134,"_145":115,"_95":164,"_155":233,"_153":167,"_99":234,"_147":-5,"_104":229,"_149":226,"_158":169,"_151":27,"_157":27,"_98":235},"1d3dedac-3abb-11f0-8432-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://bao-simplevalueapi.web.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",372,[164],{"_145":115,"_99":234,"_104":237,"_148":134,"_172":238},["D",1748312934733],[239],{"_102":240,"_148":134,"_145":115,"_95":164,"_155":241,"_153":167,"_99":242,"_147":-5,"_104":237,"_149":234,"_158":169,"_151":27,"_157":27,"_98":243},"55d1b252-3aa2-11f0-9b5b-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://bao-simplevalueapi.web.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided.\n
\n
\n Just hang on for a for a few more seconds...\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://bao-gameresult.web.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",371,[164],{"_145":115,"_99":242,"_104":245,"_148":134,"_172":246},["D",1748312620733],[247],{"_102":248,"_148":134,"_145":115,"_95":164,"_155":249,"_153":167,"_99":250,"_147":-5,"_104":245,"_149":242,"_158":169,"_151":27,"_157":27,"_98":251},"9aa94abc-3aa1-11f0-bbb6-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef[]>([]);\n const [copied, setCopied] = useState(false);\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n const [knownTexts, setKnownTexts] = useState([]);\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 (isMobileNative()) {\n window[\"WebNativeBridge\"].nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function fetchQuote() {\n try {\n const known = await getKnownTexts();\n setKnownTexts(known);\n\n let loadedFromUUID = false;\n if (uuid) {\n const response = await fetch(`https://bao-simplevalueapi.web.val.run/getValue?id=${uuid}`);\n const responseData = await response.json();\n\n const newCipher = responseData?.value?.cipher;\n const author = responseData?.value?.author;\n if (newCipher && author) {\n setCipher(newCipher);\n setQuoteAuthor(author);\n loadedFromUUID = true;\n\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n }\n\n if (!loadedFromUUID) {\n let keyword = \"\";\n let quote = \"\";\n let author = \"\";\n while (quote === \"\") {\n const randomId = Math.floor(Math.random() * quoteCount) + 1;\n const response = await fetch(`/quote?pageId=${randomId}`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 70) {\n keyword = responseData.keyword;\n quote = responseData.quote;\n author = responseData.author;\n break;\n }\n }\n const typeNumber = Math.random();\n const groupingType = Math.random() < 0.6 ? \"aristocrat\" : \"patristocrat\";\n const type = groupingType === \"aristocrat\"\n ? (typeNumber > 0.667 ? \"random\" : (typeNumber <= 0.333 ? \"k1\" : \"k2\"))\n : (typeNumber < 0.5 ? \"k1\" : \"k2\");\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({ plainText: quote, keyword, positionLetter, type, groupingType });\n setCipher(newCipher);\n setQuoteAuthor(author);\n if (uuid) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/setValue\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n value: { cipher: newCipher, author },\n }),\n });\n }\n // Initialize decryption attempt with empty strings\n const initialAttempt = newCipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input\n inputRefs.current = initialAttempt.map(() => createRef());\n\n setIsLoading(false);\n }\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n setLoadingError(`${error}`);\n setIsLoading(false);\n }\n }\n\n fetchQuote();\n }, []);\n\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (index: 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[index] = uppercaseValue;\n\n // Find all indices of the same encoded letter and fill them\n decryptionAttempt.forEach((letter, idx) => {\n if (cipher.encoded.replace(/\\s/g, \"\")[idx] === cipher.encoded.replace(/\\s/g, \"\")[index]) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex((letter, i) => letter === \"\" && i > index);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex((letter) => letter === \"\");\n if (firstUnfilledIndex !== -1 && inputRefs.current[firstUnfilledIndex]?.current) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (index: number, event: React.KeyboardEvent) => {\n if (!cipher) return;\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[index]) {\n if (index > 0) {\n const prevIndex = index - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedWithoutSpace[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === 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 = encodedWithoutSpace[index];\n const newAttempt = decryptionAttempt.map((letter, index) =>\n encodedWithoutSpace[index] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[index].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n const initialAttempt = cipher.encoded.replace(/\\s/g, \"\").split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) { return; }\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 appendToLocalStorage(cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log:\n `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n if (!isMatch && uuid && name) {\n await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }`,\n }),\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) { return; }\n if (cipher) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n appendToLocalStorage(cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await fetch(\"https://bao-simplevalueapi.web.val.run/addLog\", {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n id: uuid,\n log: `💀 ${name} abandoned the mission`,\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 {\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) { return; }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLetter = cipher.encoded.replace(/\\s/g, \"\")[currentFocusIndex];\n const originalLetter = Object.entries(cipher.reverseSubstitutionMap)\n .find(([encoded]) => encoded === encodedLetter)?.[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 (cipher.encoded.replace(/\\s/g, \"\")[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((letter, i) => letter === \"\" && i > currentFocusIndex);\n if (nextUnfilledIndex !== -1 && inputRefs.current[nextUnfilledIndex]?.current) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\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] !== \"\" && encodedWithoutSpace[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 encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (encodedWithoutSpace[index] === encodedLetter && decryptionAttempt[index] !== \"\") {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedWithoutSpace = cipher.encoded.replace(/\\s/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedWithoutSpace[index];\n }\n }\n return \"?\";\n };\n\n const indexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(\" \");\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n if (isLoading)\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

}\n

\n Our agents are still busy at work retrieving intel. Due to the nature of this work, no further details can be\n provided...\n
\n
\n Just hang on for a for a few more seconds.\n

\n \n );\n if (!cipher) return

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

;\n\n const resultUrl = `https://bao-gameresult.web.val.run/?id=${uuid}`;\n\n return (\n \n {!isMobileNative() &&

Cipher Challenge 🕵️

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

\n You have decoded this one before.\n

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

\n )}\n

\n )}\n\n {startTime !== null\n && (\n

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

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

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

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

\n \n

\n URGENT NOTICE\n

\n )}\n

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

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n },\n );\n}",370,[164],{"_145":115,"_99":250,"_104":253,"_148":134,"_172":254},["D",1748240860561],[255],{"_102":256,"_148":134,"_145":115,"_95":164,"_155":257,"_153":167,"_99":258,"_147":-5,"_104":253,"_149":250,"_158":169,"_151":27,"_157":27,"_98":259},"86439bf6-39fa-11f0-a059-9e149126039e","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { array } from \"https://esm.sh/@types/prop-types@15.7.14/index\";\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport React, { createRef, useEffect, useRef, useState } from \"https://esm.sh/react@18.2.0\";\n\nconst quoteCount = 3186;\n\nfunction isMobileNative(): boolean {\n return Boolean(window[\"WebNativeBridge\"]);\n}\n\nasync function sendBridgeMessage(message: { action: string; data: any }): Promise {\n return await window[\"WebNativeBridge\"]?.webToNative?.(message);\n}\n\nconst tutorialUrl =\n \"https://sites.google.com/site/cryptocrackprogram/user-guide/cipher-types/substitution/aristocratpatristocrat\";\n\nfunction getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nfunction 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\nfunction present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nfunction 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\nfunction isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nasync 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}\n\nfunction generateHint(quote: string): { 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 = Math.random() < 0.5 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique 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 exactly 4 unique 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 === 4) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find 4 unique letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n\nfunction randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nfunction 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\nfunction randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [shuffledAlphabet[swapIndex], shuffledAlphabet[i]];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\",\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`,\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char),\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence.slice(keywordLedSequence.length - positionIndex)\n .concat(keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex));\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(keyword, ALPHABET[(positionIndex + 1) % ALPHABET.length], type);\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nfunction substitutionEncode(\n args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n },\n): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } = substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n const normalizedTextWithSpace = plainText.toUpperCase().replace(/[^A-Z\\ ]/g, \"\");\n encodedGrouped = normalizedTextWithSpace.split(\"\").map(letter => {\n return letter === \" \" ? \" \" : substitutionMap[letter];\n }).join(\"\");\n } else if (groupingType === \"patristocrat\") {\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText.split(\"\").reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {});\n\n // 4.4 Hint (only give hint if it's patristocrat)\n const hintInfo = groupingType === \"aristocrat\" ? { hint: \"\", source: \"\" } : generateHint(plainText);\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n\nfunction App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [cipher, setCipher] = useState | null>(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(null);\n const inputRefs = useRef

History