By just using the name with out using DNS search for the IP and you are going no where. Also TCP issue comes in to play as send CRC with it data as transmitted to vailed it.

Sounds so much like lame ar#s painted already!

In data communications the CRC is a hash guaranteed to be unique over a specific number of bits. A CRC-16 is unique for files up to 2^16 bits in length, CRC-32 for up to 2^32 bits. Different CRC algorithms use different bits to generate the feedback used to digest the data into a hash. (early 1970’s?) CRC’s were first used to detect data errors over serial data links. Early example: IBM mainframe to terminal equipment communications using SNA and SDLC protocols. TCP/IP protocol uses a CRC-32 to detect packet errors. (Mid 19080’s)

The field of cryptography, specifically public key cryptography, needed secure hashing algorithms. (Only secure in the sense that the estimated length of time to brute force content that will generate a specific hash value will take a very long time on the order of many CPU years. RSA patented various Message Digest functions (in the 1970’s, several RSA patents recently expired and are now public domain). Most of us are familiar with the MD5 algorithm in which several P2P applications use to generate file Hash values. The whole Idea of using a Message Digest function in cryptography was to generate a hash on a plain text document (file) such that it could be used to detect if that document changes in any way. If any character in the document (file) is different then the hash will be different. These hashes are used when digitally signing a document, to verify that a document is the exact same (uniquely identified) document you viewed before signing. To prevent someone from changing the hash, it is encrypted using your private key so that others can verify using your public key. The results of processing the document using the MD function should exactly match the hash decoded using your public key.

Databases have used such hashing algorithms to generate unique keys for locating data in a database. Software has a good example in the C++ language standard template library in the implementation of the std map object. The map object stores a key, the key can be plain text, but is usually a hash to minimize the number of characters that need to be compared when dealing with long strings. The key is used in a binary search to locate the mapped data. This technique was introduced in the STL library in the mid 1980’s when C++ first appeared, but the general technique in software originates in Data structure text books well before that. Earliest reference I can cite from the top of my head is in Donald Knuth’s “the art of computer programming” from the early 1970’s.

Exo

Has such thing been do science for years, in mathermatic’s, in nature and has been made public.

One thought DNA in nature, DNA has been know about for about 20 years. They have know each and everyone has DNA code and I will not have same DNA as you the reader (or something with odd’s of 1:1000000xxxx’s). Then find out when the first DNA database was built (ie police) and there you have it. DNA is now software.

Get the idea. Software patents are as darft as a bush.

Hopefuly 1 of those 500 the have breached and counter suit can be issued.

Higgy.

That hash is just a random string. If it matches anything, not my fault ;).

I’m not sure how much prior art there is on this, but I’d think there was something. If anyone can find any prior art on this, please let us know.

Higgy.

In Canada we don’t have software patents.
And this case amply illustrate why we should not have them.

Lame duck patents indeed.
If this case is as ludicrous as it looks, this might be a job for the EFF.

I dont know but isn’t that a prior art to this idea.

http://www.japanprize.jp/e_1999(peterson).htm

Their patent is only dangerous, because it could be used against small startups to keep them from ever evolving into mature p2p-networks. Just oimagine you being a small programmer without much knack for patent-law and getting such a letter.

Drake