PE Check123 Difference between revisions of "Chapter 2" - Thomas Pynchon Wiki | Bleeding Edge

Difference between revisions of "Chapter 2"

(Created page with "==Page 10== '''hashslingrz'''<br /> A hash slinger is a cook or food server in a cheap restaurant, especially one who is discourteous or inattentive to customers. However "has...")
 
Line 1: Line 1:
 +
{{BE PxP Header}}
 +
 
==Page 10==
 
==Page 10==
 
'''hashslingrz'''<br />
 
'''hashslingrz'''<br />

Revision as of 08:07, 9 September 2013

Please keep these annotations SPOILER-FREE by not revealing information from later pages in the novel.

How to Format Entries

Quoted Text
Explanation or analysis of Quoted Text

Individual opinions or discussion. Sign by writing "~~~", if you like.

To add a page: Type ==Page xx==

Please add entries for each page in the order they appear on the page.

Page 10

hashslingrz
A hash slinger is a cook or food server in a cheap restaurant, especially one who is discourteous or inattentive to customers. However "hash" has a very different meaning on the Internet....

From Webopedia:

Producing hash values for accessing data or for security. A hash value (or simply hash), also called a message digest, is a number generated from a string of text. The hash is substantially smaller than the text itself, and is generated by a formula in such a way that it is extremely unlikely that some other text will produce the same hash value. Hashes play a role in security systems where they're used to ensure that transmitted messages have not been tampered with. The sender generates a hash of the message, encrypts it, and sends it with the message itself. The recipient then decrypts both the message and the hash, produces another hash from the received message, and compares the two hashes. If they're the same, there is a very high probability that the message was transmitted intact. Hashing is also a common method of accessing data records. Consider, for example, a list of names:

  • John Smith
  • Sarah Jones
  • Roger Adams

To create an index, called a hash table, for these records, you would apply a formula to each name to produce a unique numeric value. So you might get something like:

  • 1345873 John smith
  • 3097905 Sarah Jones
  • 4060964 Roger Adams

Then to search for the record containing Sarah Jones, you just need to reapply the formula, which directly yields the index key to the record. This is much more efficient than searching through all the records till the matching record is found.

Page 11

Personal tools