规则
方法 / 原理如何？-
+ 规则
工作 / 活动什么？[结果]『这是我做的。接下来打算如此做…』
查看更多..在不安全的浏览器和网络可以窥视之前，人们一直关心真实性的保存，以及他们想法存在时间的证明。
证明发布适用于大多数已知的区块链，您甚至可以输入自己的自定义区块链。
- 以原本语言显示 -People had been concerned about the preservation of authenticity, and proof of time of existence of their ideas, before the time when an insecure browser and the web could peep into.
Proof-posting works with most of the known blockchains, and you can even enter a custom blockchain of your own.
-24.0000 ħ (10.0 HOUR) (+0.0)-1.0000 ħ (1.0 HUR) (+0.0)为了提高首页首次访问者的信噪比，我隐藏了菜单，压缩操作，让眼睛专注于内容。
- 以原本语言显示 -To increase the signal-to-noise ratio for first-time visitors of the home page, I have hidden menus, and compacted operations, so as to let the eyes focus on content.
However, apparently, some people didn't like it, because it is not clear what to do, so, I mostly reverted the change.
-10.0000 ħ (10.0 HUR) (+0.0)现在可以锁定目标，创建投资预告，并与潜在的利益相关方分享。
- 以原本语言显示 -It is now possible to lock targets, create teasers for investment, and share them with potential interested parties.
-24.0000 ħ (10.0 HOUR) (+0.0)我实现了一个散列，它采用以前的数据和当前列以及以前的散列来生成整个数据库的散列。
这允许我们在编写同步器部分时以最少的数据传输进行同步，该部分将重新散列所有自己的数据，然后检索已排序数据的二进制搜索的散列。
- 以原本语言显示 -I implemented a hash that takes previous data and current column and the previous hash to produce a hash of the entire database.
This allows us to synchronize with the minimum of data transmissions when I write the synchronizer part which shall rehash all its own data, then retrieve the hash of a binary search of the sorted data.
-3.0000 ħ (3.0 HUR) (+0.0)
[结果]『我找到了如何实现这样的事…』
世界建模助手115 ᵈ周 8 日 前 @ Resilience to the worst of humanity
–
—尹与及
