Lex

Browse

GenresShelvesPremiumBlog

Company

AboutJobsPartnersAffiliates

Resources

DocsInvite FriendsSupport

Legal

Terms of ServicePrivacy Policygeneral@lex-books.com(215) 703-8277

© 2026 LexBooks, Inc. All rights reserved.

S. P. Scott

S. P. Scott

Famous Quotes

View all 15 quotes

“Continuing up Rennes. Dodging little Saabs and Renaults. Loving walking here. Sun alternately streaming. Obliterating physiognomies. No longer nouns. But movement. Disappearing. Now heavily raining. Sitting out anyway. Over drain smelling of beer. Metro. Sewers. Fetid breath of Paris. Two cold coffees. Watching shadows lengthening. On la Gaite opposite. Where Colette once performing. Having walked in old boots across city. Drawing mole above lip. Rice-powdering delicious arms. Paris a drug. P saying on phone. Yes Paris a drug. A woman. And I waking this a.m. Thinking there must be some way. Of staying. Now my love’s silhouette of rooftops eclipsing. Into night. Cold heinous breath. Blowing on privates. Through grille underneath.””

My Paris

“P.S. I offer a topic for discussion. The past is nothing more than the present romanticized, while the future is history with imagination. Any thoughts?””

The Lemoncholy Life of Annie Aster

“SHORT NOTE ABOUT SHA-1 A lot of people become concerned at some point that they will, by random happenstance, have two objects in their repository that hash to the same SHA-1 value. What then? If you do happen to commit an object that hashes to the same SHA-1 value as a previous object in your repository, Git will see the previous object already in your Git database and assume it was already written. If you try to check out that object again at some point, you’ll always get the data of the first object. However, you should be aware of how ridiculously unlikely this scenario is. The SHA-1 digest is 20 bytes or 160 bits. The number of randomly hashed objects needed to ensure a 50% probability of a single collision is about 280 (the formula for determining collision probability is p = (n(n-1)/2) * (1/2^160)). 280 is 1.2 x 10^24 or 1 million billion billion. That’s 1,200 times the number of grains of sand on the earth. Here’s an example to give you an idea of what it would take to get a SHA-1 collision. If all 6.5 billion humans on Earth were programming, and every second, each one was producing code that was the equivalent of the entire Linux kernel history (3.6 million Git objects) and pushing it into one enormous Git repository, it would take roughly 2 years until that repository contained enough objects to have a 50% probability of a single SHA-1 object collision. A higher probability exists that every member of your programming team will be attacked and killed by wolves in unrelated incidents on the same night.””

Pro Git

“Continuing up Rennes. Dodging little Saabs and Renaults. Loving walking here. Sun alternately streaming. Obliterating physiognomies. No longer nouns. But movement. Disappearing. Now heavily raining. Sitting out anyway. Over drain smelling of beer. Metro. Sewers. Fetid breath of Paris. Two cold coffees. Watching shadows lengthening. On la Gaite opposite. Where Colette once performing. Having walked in old boots across city. Drawing mole above lip. Rice-powdering delicious arms. Paris a drug. P saying on phone. Yes Paris a drug. A woman. And I waking this a.m. Thinking there must be some way. Of staying. Now my love’s silhouette of rooftops eclipsing. Into night. Cold heinous breath. Blowing on privates. Through grille underneath.””

My Paris

“P.S. I offer a topic for discussion. The past is nothing more than the present romanticized, while the future is history with imagination. Any thoughts?””

The Lemoncholy Life of Annie Aster

“SHORT NOTE ABOUT SHA-1 A lot of people become concerned at some point that they will, by random happenstance, have two objects in their repository that hash to the same SHA-1 value. What then? If you do happen to commit an object that hashes to the same SHA-1 value as a previous object in your repository, Git will see the previous object already in your Git database and assume it was already written. If you try to check out that object again at some point, you’ll always get the data of the first object. However, you should be aware of how ridiculously unlikely this scenario is. The SHA-1 digest is 20 bytes or 160 bits. The number of randomly hashed objects needed to ensure a 50% probability of a single collision is about 280 (the formula for determining collision probability is p = (n(n-1)/2) * (1/2^160)). 280 is 1.2 x 10^24 or 1 million billion billion. That’s 1,200 times the number of grains of sand on the earth. Here’s an example to give you an idea of what it would take to get a SHA-1 collision. If all 6.5 billion humans on Earth were programming, and every second, each one was producing code that was the equivalent of the entire Linux kernel history (3.6 million Git objects) and pushing it into one enormous Git repository, it would take roughly 2 years until that repository contained enough objects to have a 50% probability of a single SHA-1 object collision. A higher probability exists that every member of your programming team will be attacked and killed by wolves in unrelated incidents on the same night.””

Pro Git

Books from the author

right arrow
History of the Moorish Empire in Europe, Vol. 1 (of 3)
History of the Moorish Empire in Europe, Vol. 3 (of 3)
History of the Moorish Empire in Europe, Vol. 2 (of 3)

More authors like this

right arrow
Henry Charles Lea
Henry Charles Lea
1825-1909
Francis Aidan Gasquet
1846-1929
George Haven Putnam
George Haven Putnam
1844-1930
Mauno Rosendal
Mauno Rosendal
1848-1917
Andrew Dickson White
Andrew Dickson White
1832-1918
Pasquale Villari
Pasquale Villari
1827-1917
Edward A. Freeman
Edward A. Freeman
1823-1892
Eugène-Emmanuel Viollet-le-Duc
Eugène-Emmanuel Viollet-le-Duc
1814-1879
T. W. Allies
1813-1903
Jaime Luciano Balmes
Jaime Luciano Balmes
1810-1848
Michele Amari
1806-1889
Cesare Cantù
1804-1895
Jules Michelet
Jules Michelet
1798-1874
A. H. Sayce
A. H. Sayce
1845-1933
George Saintsbury
George Saintsbury
1845-1933
Jacob Ahrenberg
Jacob Ahrenberg
1847-1914