Hacker News Reader

Comment by diamondhandle | Hacker News Reader

Okay, and what happens when I run a phony ad next to this one in the New York Times? What happens when I bribe the guy at the Times to accidentally use my hash rather than theirs?

It’s a cute gimmick, I’ll give them that.

View on HN

They prove that the hash they publish in the NYTimes exists at that time. There are probably some archives which can give you an authorized copy of the NYTimes from a specific date. You can use that to prove that the hash existed at the date the NYTimes was published. This is now the hash over a hash tree, which this companies stores. With this single hash they can also prove that every document in this hash tree existed at that time. They can not add a extra document later, because this would alter the hash they published in the NYTimes.

When you publish your phony ad in the NYTimes, you also prove that this phony ad existed at the date the NYTimes was published.

This company probably buys one edition of the NYTimes with their add and check if the NYTimes published the correct hash, if it is wrong they will run an other add the next day with the correct hash the next day. Now they only prove that the hash existed the next day.

The NYTimes hashes idea is brilliant, but if you were to try to scale that concept to thousands or millions of different global use cases, eventually it seems like you'd end up with a technology platform similar to a public distributed ledger, i.e. a blockchain.

I'm open to hearing about any other non-blockchain solutions to this problem, though. One seems to be IOTA and their "Tangle" graph, but I don't fully understand how that could facilitate a historical record of each transaction, as (unlike a blockchain) it is not an append-only ledger.

Reply on news.ycombinator.com