TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

‘Carbon Dating’ the Internet Archive with OpenTimestamps

106 点作者 haakon将近 8 年前

7 条评论

malgorithms将近 8 年前
Like everything else Peter Todd does, this is very impressive and extremely useful.<p>And I think it&#x27;s <i>almost</i> what we need at Keybase for timestamping our own database. I figured I&#x27;d record here what&#x27;s important to us in a timestamping service, because I have a feeling (if we&#x27;re reading it correctly), OpenTimestamps doesn&#x27;t yet do quite what we&#x27;d want.<p>What we would love:<p>- to announce that our database has hash H at time T.<p>- to make all our announcements discoverable to prove we aren&#x27;t making parallel database announcements around time T.<p>The latter feature doesn&#x27;t matter if your only goal is proving data existed on a certain date. Say you want to prove you wrote a story, great, just post its hash. But feature 2 is important if you&#x27;re also trying to convince people that you aren&#x27;t telling other people <i>other</i> stories at the same time.<p>Random examples of someone wanting the second feature:<p>- a newspaper or website might like to prove that yesterday&#x27;s headlines or stories were X,Y and Z, and that they were the <i>only</i> stories yesterday. How can we know they didn&#x27;t publish 1,000,000 different headlines or variations of the stories, just to cover all the possible big news of interest, and then point at the 3 interesting ones later? Or later point at the ones that paint their editorial perspective a certain way?<p>- a money manager &#x2F; fund might like to prove they can make good stock picks, so they announce their 10 predictions for the year, and later, when they publish their predictions, you can verify they were their only 10 predictions.<p>- on Keybase we&#x27;re trying to prove that we&#x27;re not maintaining 2 different databases for all our users. If you ask who keybase&#x2F;chris is, Keybase is giving the same answer to everyone in the world, and not accidentally leaving, say, a revocation off the end of my announcements.<p>- a government might like to prove that its laws were exactly X at time T, and there weren&#x27;t some extra ones slipped in as optional extra laws later.<p>- proof you truly love only one.<p>This all seems to require an authentication method for posting things, and a way for the timestamp server&#x27;s data structure to be traversable to a poster&#x27;s announcements, so you know you&#x27;re not missing anything.<p>Right now at Keybase we do this by burning money from a specific address, an address known to be our announcement address. It&#x27;s clunky. But it achieves that goal: someone can know they&#x27;re seeing all our announcements. This is expensive and annoying to maintain, and it would be nice to see a general package that manages this kind of thing.<p>So consider this a vote for v2 supporting parties putting signed statements into open timestamp server! Or a request for clarification, if it already works this way.<p>(Thanks Peter and others who worked on this! very cool stuff.)<p>edit: formatting
评论 #14428627 未加载
评论 #14426825 未加载
评论 #14426898 未加载
apo将近 8 年前
For those who want to try something like this with little fuss, check out Proof of Existence:<p><a href="https:&#x2F;&#x2F;proofofexistence.com&#x2F;" rel="nofollow">https:&#x2F;&#x2F;proofofexistence.com&#x2F;</a>
评论 #14424342 未加载
nickpsecurity将近 8 年前
Anyone interested in this should look into Trusted Timestamping. There&#x27;s protocols and companies to study for inspiration of how to improve it combined with new work like this.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Trusted_timestamping" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Trusted_timestamping</a>
ancorevard将近 8 年前
Hope it&#x27;s more vastly more accurate than actual carbon dating.
评论 #14426163 未加载
10165将近 8 年前
No Javascript version:<p><a href="https:&#x2F;&#x2F;raw.githubusercontent.com&#x2F;opentimestamps&#x2F;opentimestamps.org&#x2F;master&#x2F;index.html" rel="nofollow">https:&#x2F;&#x2F;raw.githubusercontent.com&#x2F;opentimestamps&#x2F;opentimesta...</a><p><a href="https:&#x2F;&#x2F;archive.org&#x2F;download&#x2F;opentimestamps-calendar-backups&#x2F;" rel="nofollow">https:&#x2F;&#x2F;archive.org&#x2F;download&#x2F;opentimestamps-calendar-backups...</a><p><a href="https:&#x2F;&#x2F;ia801509.us.archive.org&#x2F;13&#x2F;items&#x2F;opentimestamps-calendar-backups&#x2F;" rel="nofollow">https:&#x2F;&#x2F;ia801509.us.archive.org&#x2F;13&#x2F;items&#x2F;opentimestamps-cale...</a><p><a href="https:&#x2F;&#x2F;github.com&#x2F;opentimestamps&#x2F;opentimestamps-client" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;opentimestamps&#x2F;opentimestamps-client</a><p><a href="https:&#x2F;&#x2F;alice.btc.calendar.opentimestamps.org&#x2F;calendar&#x2F;" rel="nofollow">https:&#x2F;&#x2F;alice.btc.calendar.opentimestamps.org&#x2F;calendar&#x2F;</a> <a href="https:&#x2F;&#x2F;bob.btc.calendar.opentimestamps.org&#x2F;calendar&#x2F;" rel="nofollow">https:&#x2F;&#x2F;bob.btc.calendar.opentimestamps.org&#x2F;calendar&#x2F;</a> <a href="https:&#x2F;&#x2F;finney.calendar.eternitywall.com&#x2F;calendar&#x2F;" rel="nofollow">https:&#x2F;&#x2F;finney.calendar.eternitywall.com&#x2F;calendar&#x2F;</a>
haakon将近 8 年前
Note: Had to take some small liberties with the headline to make it fit HN&#x27;s 80 character limit.
评论 #14423078 未加载
therealidiot将近 8 年前
&gt; tl;dr: You can now use our searchable database (works best on Chrome)<p>We&#x27;ve really gone back to how it &quot;used to be&quot; :(<p><a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;NXf6Ibz.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;NXf6Ibz.png</a>
评论 #14424393 未加载
评论 #14423818 未加载
评论 #14424474 未加载