Good post. I'm curious how this idea of transactions would work
and how it is "almost as good as Pow". Can't an attacker create
many chains that look like they have transactions (sent to one's self)
or how would the mechanics of this play out? What is meant by
staking a certain block, and couldnt that be done retroactively
by an attacker at no cost?
Right. An attacker can play all sorts of silly-buggers with a TaPoS system in the short run; that's why I can't recommend it on its own. So, yes, I'm envisioning a system with PoW mining as well, and the people making transactions getting paid for block chain security in the same ratio against the block subsidy that their transactions are counted relative to PoW mining for purposes of resolving blocks. That's why "almost" as good as PoW.
A TaPoS system becomes secure only when the "law of large numbers" means that the number of tx per block gets huge and starts to be a fairly constant amount -- the way mining effort is in a PoW system.
Staking a certain block means that when Alice sends Bob 5 coins, she gets paid a "stake security payment" amounting to interest on those 5 coins if she specifies ("stakes") a very recent block that the transaction then depends on. The transaction has that block ID recorded in it, and isn't valid in any block chain that doesn't include the block Alice staked.
In the case of a block chain fork, TaPoS counts in favor of the fork that has the most coins spent - specifically in txOuts created before the fork and used in transactions staked after the fork. If more than half the coins that were in existence as of a certain block have been spent - even once - in transactions staked after that block, then no reorg can EVER dislodge that block.
That's a stronger guarantee than PoW can really make. Although the combined hashing effort that's gone into the chain makes it impossible in practice that a reorg could ever undo more than ten or fifteen blocks, there's no mathematical guarantee. In theory, a new block chain could emerge tomorrow that undoes every transaction back to the beginning. It'll never happen, but there isn't a mathematical guarantee the way there is with a TaPoS system.
In the short run, if there's a reorg that goes back before the staked block, Alice's payment to Bob disappears. Bob is looking for (or waiting for) the stake block to be at least 6 blocks in the past to protect him from a reorg that reaches back past the transaction's stake block, the same way that in a PoW system it's wise to wait at least 6 blocks after the payment to protect you from a reorg that happens after the transaction.
So if Bob wants to be extra-sure he gets paid, he protects himself from a reorg that goes back six blocks by demanding that Alice stake earlier. He might just check some monitor to make sure there's no known fork in progress and that'll be it. If Alice is just paying for coffee, he may let her stake the very last block, the same way coffee shops in a PoW system don't wait for the next block for confirmation.
One nice thing about a TaPoS system is that miners are motivated to include all the tx they can; that makes their block the 'best block' if two are found and prevents it from getting orphaned.