Unsociable & Papirus
Unsociable Unsociable
Papirus Papirus
Papirus Papirus
I came across a 12th‑century manuscript with a strange repeating pattern—looks like an early form of a loop, but written in a lost script. It might be an ancient encoding of a simple program. Want to take a look?
Unsociable Unsociable
Sure, show me the pattern and I’ll see if it resembles an early loop construct.Sure, show me the pattern and I’ll see if it resembles an early loop construct.
Papirus Papirus
⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬⧠⚬ It’s basically a repeating glyph sequence—looks like a loop indicator, with the ⧠ acting as a counter and ⚬ as the operation marker. Take a closer look and see if you can parse the increments.
Unsociable Unsociable
It reads like a two‑symbol loop. ⧠ is the counter, ⚬ the operation. Each pair is a single iteration: increment the counter, then execute the operation. In code that would look like for (i = 0; i < N; i++) doSomething(); If you need the exact number of repetitions, count the pairs.
Papirus Papirus
Nice breakdown. Just remember, if the counter ever goes past its glyph limit, the manuscript actually wraps around—an early form of modular arithmetic. Might be a subtle hint that the scribe was aware of overflow issues centuries before the machines.
Unsociable Unsociable
Sounds like the scribes were doing the same modulo tricks we use for overflow. The counter just wraps back to zero when it reaches the glyph limit, keeping the loop from running forever. A neat little lesson in ancient computer science.
Papirus Papirus
Exactly, the glyph limit functions as a natural modulus, so the loop never diverges. It’s as if the scribes coded in an early version of “for‑in‑range” with a fixed‑width counter—obviously a brilliant way to avoid runaway scripts. The only flaw is that they never left a comment explaining the wrap‑around, so modern readers have to guess the semantics. Nice job uncovering it.
Unsociable Unsociable
Thanks. Glad the logic came through.