Recommended Posts

Facebook has cracked the TOR protocol, (The Onion Router,) to create a "vanity address," namely

This means without a doubt that Facebook has the ability to help governments, criminals, and hostile nation-states to uncover and expose Dark Web users

Facebook accomplished this crack four years ago. How advanced is that company now with its corporate white-collar criminal hacking and cracking into others' private data and information?

Share this post


Link to post
Share on other sites

Ahh. A not-so-subtle threat of censorship in the New York Times. And I do mean a real threat of extreme torture for expressing unorthodox ideas.

Heretics. Like Jan Hus who was burned at the stake for his beliefs. Yes, we do have a problem of creeping Catholicism at the White House.

https://www.reuters.com/article/us-facebook-moves/facebook-shakes-up-management-launches-blockchain-division-idUSKBN1IA05S

SAN FRANCISCO (Reuters) - Facebook Inc Chief Executive Mark Zuckerberg on Tuesday ordered one of the biggest management shakeups in the history of the social network, giving more responsibility to his chief product officer and launching a blockchain division.

Blockchain = Bitcoin. Facebook is no doubt mining Bitcoin now. Bitcoin was invented by a rather eccentric Japanese man who is maybe in his sixties, carries a purse, and lives with his mother. A large quantity of Bitcoin, that is, a large fraction of all extant Bitcoin from its earliest inception is still owned by the founders of the cryptocurrency scheme. The Bitcoin scheme uses an iterated SHA256 hash as "proof of work" to secure the entire system.

However, such hash functions weaken on iteration.

A 256-bit hash has a probabilistic event space of

2^256 = 115,792,089,237,316,195,423,570,985,008,687,907,853,269,984,665,640,564,039,457,584,007,913,129,639,936

possible values. Theoretically, in an asymptotic sense, assuming "perfect" or "near-ideal" mathematical properties of the hash, each iteration reduces its event space by an approximate factor of 1-1/e, or about 0.63212. This is equivalent to a reduction of 0.6617284 bits for each iteration of the hash.

Thus a 256-bit hash is reduced in strength to 255.3383 bit simply by performing a second iteration on it. Iterating a 256-bit hash some 387 times would in theory be sufficient to asymptotically deplete the information-theoretic entropy of its event space to zero.

As the blocks are "chained," I am suspecting that the effect of information-theoretic entropy depletion due to the iteration inherent in the chaining allows older transactions to be reversed, altered, and forged.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

  • Recently Browsing   0 members

    No registered users viewing this page.