Timeline for How was this Mersenne Twister seed for a 20-character string known a priori found?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2018 at 21:34 | vote | accept | Spenser Truex | ||
| Apr 15, 2018 at 18:45 | history | tweeted | twitter.com/StackCrypto/status/985589945766240258 | ||
| Apr 15, 2018 at 3:07 | answer | added | poncho | timeline score: 6 | |
| Apr 15, 2018 at 1:12 | history | edited | Spenser Truex | CC BY-SA 3.0 |
added 189 characters in body
|
| Apr 15, 2018 at 1:07 | comment | added | Spenser Truex | @fgrieu The Befunge program is in the question, in a code block. The Befunge generates the Hello, World output. The seed programming language is explained in the links, but I will rehash it in this comment: You execute the Seed interpreter (supplied in the link) with a length argument and a seed argument. The seed is used in the Mersenne Twister to generate length-argument number of characters. Those characters are executed in the Befunge programming language. | |
| Apr 12, 2018 at 16:45 | comment | added | fgrieu♦ | The question would get a better chance to get answered and be deemed on-topic if it came with 1) a description of how exactly, in the Seed programming language, the seed input is processed; or at least, a link to the source of the relevant interpreter, for the part that acquires the seed number, setups the Mersene Twister, and turns its output into a Befunge program. 2) Said Befunge program, which if I get it correctly is a mere 20 ASCII characters. | |
| Apr 12, 2018 at 16:04 | history | edited | Spenser Truex | CC BY-SA 3.0 |
Typo
|
| Apr 12, 2018 at 15:59 | review | First posts | |||
| Apr 12, 2018 at 17:36 | |||||
| Apr 12, 2018 at 15:58 | history | asked | Spenser Truex | CC BY-SA 3.0 |