Book-key search
Can a bounded search recover a known key?
Projects / A book cipher
A known answer. A wider reading list. A test of the method.

A short cipher can have more than one convincing reading. This example shows how a bounded search might be presented: fix the message and source texts, test candidate passages, then compare the result with an answer held back from the search.
Voting is closed in this static preview.
Can a bounded search recover a known key?
Bounty history has not been reviewed for funding here. Any project that has ever carried a paid bounty is excluded.
This is a designed fixture preview. No source-text bundle or research execution is attached yet.