You can see the Internet Archive's records of Premises, Premises here.

Note that as of this writing, there's a six-month delay between the time that the Internet Archive spiders a site and when the corresponding snapshot becomes searchable online-- so the preceding link won't lead to any Premises, Premises ideas that have been posted recently.

The Telewizja Polska USA, Inc. vs. Echostar Satellite Corporation decision is great, but Internet Archive crawls are relatively infrequent. For a finer-grained trail of what-appeared-when on this site, accurate down to the day, Premises, Premises ideas are still timestamped, archived, and notarized in accordance with the method described below.

-=-=-=-=-=-=-

Here's how Premises, Premises provides foolproof evidence that its ideas were posted on the dates indicated. This procedure protects the ideas' owners by proving that they thought of them first (if, in fact, they did).

Procedure
The entire contents of the Premises, Premises database are periodically written out to an archive file which is then compressed with gzip, a standard Unix utility, and hashed to an unique key code, a "fingerprint," using the standard MD5 algorithm. The integrity of the archive is guaranteed because if the file is altered in any way, it will not produce the same key. The archive files and their MD5 keys are both stored on the site's server, as listed below. Printouts of the archive filenames and corresponding keys are then logged by a notary public in the real world, thereby proving the existence of the database in its archived state before the time that its code was notarized.

The archive files are not downloadable by the public, but if a dispute arises over an idea posted here, this site's administrator will be more than happy to provide these files as evidence to any investigator. Contact Paul, pspinrad at premisespremises dot com.

About MD5
The MD5 algorithm generates "fingerprints" of input files that are 128 bits long. In RFC 1321, the algorithm's inventor, Ronald Rivest, explains:

It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest.