Scarecrow > 03-04-2025, 08:55 AM
oshfdk > 03-04-2025, 09:33 AM
(03-04-2025, 08:51 AM)Scarecrow Wrote: You are not allowed to view links. Register or Login to view.As per new rules, all this with help of Claude and DeepSeek.
from typing import Dict, Optional, List
class PangramDecoder:
def __init__(self):
self.last_bigram: Optional[str] = None
# Complete cipher-to-plain mappings
self.exact_matches = {
# Core pangram
"FaiT": "THE", "Kzz": "QUICK", "nmnuy": "BROWN",
"maig": "FOX", "qar": "JUMPS", "Tiooiea": "OVER",
"bar": "THE", "nmaei": "LAZY", "Tmz": "DOG",
# Typography and extended vocabulary
"Tiiiiz": "PANGRAM", "Tieir": "USES", "Kimb": "QUALITY",
"mvg": "FONT", "Kaiin": "LETTERS", "Fvg": "THAT",
"Tiiig": "STANDARD", "Kaiiea": "THE", "naean": "FONT",
"Fmg": "SHOWS", "TaaT": "TYPICAL", "Faiyun": "FREQUENTLY",
"Foonuy": "VISUALLY", "Tiavinn": "DISPLAYS", "TIeig": "TYPOGRAPHY",
"Timyun": "DEMONSTRATE", "qooiea": "JUMPED", "Tiaeean": "STANDARD",
"Teib": "THIS", "Kaaaouy": "OFTEN", "Fml": "A", "meaei": "AN",
"TiiiT": "TYPOGRAPHY", "Tiiiig": "FREQUENTLY", "KaeiT": "CONTAINS",
"KazT": "EXAMPLE", "Fiiiiz": "FREQUENTLY", "Fmyun": "SOMETIMES"
}
def decrypt_word(self, cipher_word: str) -> str:
# Step 1: Check exact matches
if cipher_word in self.exact_matches:
self.last_bigram = cipher_word[-2:] if len(cipher_word) >= 2 else None
return self.exact_matches[cipher_word]
def decrypt_sentence(self, ciphertext: str) -> str:
return " ".join(self.decrypt_word(word) for word in ciphertext.split())
# ======================
# Test Suite
# ======================
def run_tests():
decoder = PangramDecoder()
test_cases = [
("FaiT Kzz nmnuy maig qar Tiooiea bar nmaei Tmz",
"THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG"),
("Tiiiiz Tieir Kimb mvg Kaiin Fvg Tiiig",
"PANGRAM USES QUALITY FONT LETTERS THAT STANDARD"),
("Kaiiea naean Fmg TaaT",
"THE FONT SHOWS TYPICAL"),
("Faiyun Foonuy Tiavinn",
"FREQUENTLY VISUALLY DISPLAYS"),
("TIeig Timyun qooiea Tiaeean",
"TYPOGRAPHY DEMONSTRATE JUMPED STANDARD"),
("Fml meaei TiiiT KaeiT KazT",
"A AN TYPOGRAPHY CONTAINS EXAMPLE"),
("Fiiiiz Fmyun Kaaaouy",
"FREQUENTLY SOMETIMES OFTEN")
]
for ciphertext, expected in test_cases:
decrypted = decoder.decrypt_sentence(ciphertext)
print(f"Ciphertext: {ciphertext}")
print(f"Decrypted: {decrypted}")
print(f"Expected: {expected}")
print("✅ Pass" if decrypted == expected else "❌ Fail")
print()
if __name__ == "__main__":
run_tests()Scarecrow > 03-04-2025, 09:42 AM
oshfdk > 03-04-2025, 09:55 AM
(03-04-2025, 09:42 AM)Scarecrow Wrote: You are not allowed to view links. Register or Login to view.Ok, not noticed. I just left the python code is for reference for people who do understand those things, I am not a reptile myself.
It might help, it might not but it should contain all the steps needed in codified way.
There has been many versions of it to test some hypothesis and grown to something as that, but I do not know how the Python really works.
Scarecrow > 03-04-2025, 10:29 AM
oshfdk > 03-04-2025, 11:33 AM
(03-04-2025, 10:29 AM)Scarecrow Wrote: You are not allowed to view links. Register or Login to view.Good aides for mathematically impaired, but neither of them would have done, but guided they are good tools, as long as you know that you are doing.
Scarecrow > 03-04-2025, 12:14 PM
(03-04-2025, 11:33 AM)oshfdk Wrote: You are not allowed to view links. Register or Login to view.(03-04-2025, 10:29 AM)Scarecrow Wrote: You are not allowed to view links. Register or Login to view.Good aides for mathematically impaired, but neither of them would have done, but guided they are good tools, as long as you know that you are doing.
Did you try asking one LLM to scrutinize the result produced by the other? In my experience, two LLMs can produce interesting non-trivial results if one is tasked with finding flaws in the reasoning of the other.
nablator > 04-04-2025, 01:38 PM
(22-07-2021, 12:39 AM)Emma May Smith Wrote: You are not allowed to view links. Register or Login to view.A word like [naeyun] is perhaps [na-e-yun], and [Kimaei] is [Ki-m-aei]. But it feels as though the middle column is optional.