zawy12

Results 67 issues of zawy12

My understanding of BCH indicates this attack is possible. The difference between this and a regular selfish mine is that the attacker can get an unlimited number of blocks. The...

**CN coins:** The last test of your fork is to make sure your new difficulties when you sync from 0 are matching the old difficulties when running the pre-fork code....

![image](https://user-images.githubusercontent.com/18004719/74104615-55496280-4b24-11ea-9331-b92669eefcd9.png) "A Compleat Collectioin of Englifh Proverbs" - Rev. John Ray, **_1668_**, [page 33](https://archive.org/details/acompleatcollec00raygoog/page/n33/mode/2up) ### Overview The following are clock and timestamp requirements for distributed consensus. Following these rules prevent...

This describes the a DAG-based blockchain that uses Nakamoto consensus to get permanent ordering in only 1x the propagation delay if there's no increase or shift in network hashrate. Other...

See also [Tom Harding's RTT paper.](https://ledger.pitt.edu/ojs/index.php/ledger/article/view/195) This is a special difficulty algorithm that "tightens the Poisson" of solvetimes, keeping them closer to the target. It continually lowers the difficulty during...

This discusses an accuracy error in fixed-window difficulty algorithms that was brought to my attention by Pieter Wuille's [twitter poll](https://twitter.com/pwuille/status/1098288749098795008) and [result](https://twitter.com/pwuille/status/1098651788343955456). Meni Rosenfeld wrote a **[paper](https://arxiv.org/pdf/1708.05185.pdf)** about it in...

By "vote" in this article I'm referring to "lottery ticket purchases". This shows how Nakamoto consensus can be viewed within the framework of classical BFT consensus proofs. In short, each...

**Update:** I did an [HTML+javascript web page](https://github.com/zawy12/difficulty-algorithms/blob/master/seed_words/seed_words.html) to convert BIP39 words to sentences and to recover up to 3 seed words if you've saved the hash of the seeds. I...

Dark Gravity Wave problems: 1. The complicated core [[code](https://github.com/dashpay/dash/blob/855ac356adc1a08b90526cb83890c579b1dc308a/src/pow.cpp#L141)] in the main loop is just a simple moving average of the targets that gives double weight to the most recent...

[**update:** the e^x forms I described in this issue in 2018 are unnecessarily complicated and they give almost identical results to ASERT. The simpler way to view this content is...