It might be worth coming up with a general mechanism for Secret but
Confirmable information. Following drafty draft needs help:
The Rules can define a type of information as Classified.
To do so, the Rules must specify a date or event after which
that type of information becomes Declassified.
A person CAN publish a text string of limited size, clearly
labeling the sting as containing a specific, defined type of
classified information. Such a string is an Encoding. The
recordkeepor of the indicated type of information SHALL track
such encodings when e reports eir record for that information,
up until the time the recordkeepor announces its declassification.
As soon as possible after a particular Encoding becomes
Declassified, its recordkeepor SHALL announce the
declassification. As soon as possible after such an
announcement, the originally posting player CAN and SHALL Decode
the information by publishing a different statement (the
Plaintext) and publishing or referencing a method (the encoding
algorithm) by which the Plaintext was converted into the Encoding.
If the plaintext is published within the time limit, and if the
encoding algorithm is a method that is:
(a) reasonably and generally available to most players, such
that most players could confirm that the plaintext
produces the encoding via the algorithm;
(b) not tailored to the message so that it would not function
for arbitrary text strings of a similar nature; and
(c) makes it sufficiently difficult to create multiple
sensible plaintexts that could lead to the same encoding;
then the encoding is interpreted as if its plaintext had been
published at the time the original encoding was published.
[
This is meant to have safeguards. It's meant to allow flexibility
(i.e. choice of algorithm from among common ones) without abuse.
Condition (b) is meant to prevent "my algorithm is that AGAINT = FOR"
Condition (c) is meant to prevent encoding with "1=AGAINST 2=FOR" and
then decoding with "1=FOR 2=AGAINST".
The original poster also MUST decode the information. Otherwise, a
trivial trick is to publish two hashes (1 for FOR, 1 for AGAINST) and then
only decode one of them.
Probably other holes, that's the fun tho.
]
