j"1LAnZuoQdcKCkpDBKQMCgziGMoPC4VQUckM<div class="post"><div class="quoteheader"><a href="https://bitcointalk.org/index.php?topic=43.msg540#msg540">Quote from: satoshi on February 25, 2010, 11:06:29 PM</a></div><div class="quote">I don't know what you're talking about accepting easier difficulties.<br/></div><br/>We were essentially discussing Sabunir's question about what prevents someone from messing with the program's source code to adjust block-generating difficulty to be very easy, then make a network on his own and create a, say, 50,000-block proof-of-work within seconds then finally propagate it across the real network to steal "votes" towards his new fake blocks as technically, his proof would be "the longest". So is there a way to verify how much work was actually put into a given PoW (for eg. how many zero's are at the beginning of each hash or something)?<br/><br/><div class="quoteheader"><a href="https://bitcointalk.org/index.php?topic=43.msg376#msg376">Quote from: satoshi on February 16, 2010, 05:36:40 PM</a></div><div class="quote">It wouldn't work anyway because that would be only 1 minute average between blocks, too close to the broadcast latency when the network gets larger.<br/></div>Since we're at it, what's the approximate time for proof-of-work propagation across a network of about 100,000 machines? Is there a way to optimize connections so that broadcasting is done via a pyramid-form to minimize the needed time? For example, the block creator sends it to 10 nodes, then those 10 send it to a 100 provided that none of those 100 were among the original 11, then those 100 tell a 1000 provided that none of those 1000 were among the original 111, etc to save time.</div> text/html
https://whatsonchain.com/tx/8df1c119cd0fc2ce8841925ca15eef15601f398784e2742e56a8db2e6b2d95fb