Blockchain Proof of Location – SolidX Blog

Blockchain Proof of Location – SolidX Blog

An event (defined by the hash H) can be constrained to exist within a time window A <, t <, B by hashing H with the most latest block hash A ter a blockchain, and incorporating them both into the next block B=hash(H,A,nonce). Bitcoin’s proof-of-work algorithm also has a nonce and I’m glossing overheen details of combining H from many participants into a Merkle tree. Read More