Greedy Heaviest-Observed Sub-Tree

Greedy Heaviest-Observed Sub-Tree is an alternative chain-selection method that is designed to incentivize stale blocks (uncles) as well, thus reducing the incentive for pool mining. In GHOST, even the confirmation given by stale blocks to previous blocks are considered valid, and the miners of the stale blocks are also rewarded with a mining reward.

Reference:

http://ethdocs.org/en/latest/glossary.html

Leave a Reply

Your email address will not be published. Required fields are marked *