Re: Proof-of-stake can never scale without blowing up, because PoS isn't trustless
Not trying to get in a heated debate or anything, but trying to wrap my head around the claims that difficulty is different from PoW to PoS.
From my understanding, both difficulty adjustment algorithms (although altered from coin to coin) are looking at the time it took to produce a new block. If the time is greater than the targeted block time, then difficulty goes down so that it is easier to produce the next block, if the time it took was less than the target difficulty goes up so that it is harder to produce the next block. I don't see any real conceptional difference in the difficulty adjustment algorithms.
I suppose that maybe its an argument about the valid proof required to create that block rather than the adjustment algorithm itself (sorry the thread has been a bit difficult to follow).
Admittedly, I am not a crazy expert programmer. I am still working on my masters in CS, and learn new things all the time. I have however, what I consider a pretty good fundamental understanding of Bitcoin and Peercoin code bases.
From my understanding, both difficulty adjustment algorithms (although altered from coin to coin) are looking at the time it took to produce a new block. If the time is greater than the targeted block time, then difficulty goes down so that it is easier to produce the next block, if the time it took was less than the target difficulty goes up so that it is harder to produce the next block. I don't see any real conceptional difference in the difficulty adjustment algorithms.
I suppose that maybe its an argument about the valid proof required to create that block rather than the adjustment algorithm itself (sorry the thread has been a bit difficult to follow).
Admittedly, I am not a crazy expert programmer. I am still working on my masters in CS, and learn new things all the time. I have however, what I consider a pretty good fundamental understanding of Bitcoin and Peercoin code bases.
IMO and In Reality,
you're a better Proof of Stake programmer than iamnotback.
Which is why I told him he should ask you , since you have more experience in this specific area.
My premise has been Longest Chain with the most difficulty wins in Proof of Stake or Proof of Work and can overwrite a shorter chain of less difficulty.
In his misleading conclusions , he claims this is only valid for Proof of work.
Which makes absolutely no sense and makes this whole topic just seem like a misleading hit piece against PoS.
