Guys, (only watch topic a little, but not read, difficult exams) i think you are go
around POS(proof of stake), when mining more simple on wallets(addresses),
which have more coins (i can mistake, but something like this). It have positive side "mine to keep",
but a negative too "mine to keep to mine to keep" or simply currency turns into "bag of gold" for dark
day and don't circulate (no reason to spend money). It's a mechanism, which known for some time.

I'm understand, that your mechanism is different, but it's realy hard to differ "loyal" miner from jumper.
The hashing is like roulete the target diff hash can be found on first millisecond or after hundreds of
years of calculations the question of probability. The output of hasing function (if we will give it any
input sequence(exept inverse hash function, existence simple form of which is question of crypo resistance))
made to be most alike random seqence with uniform law of distribution of probability to prevent
"attack of days of births"(it's code theory slang, so i can mistake with translation).

So(for clear crypto currency theory we need to examine only cases with solo mining)
If miner is "loyal" it's not prevent him from not founding a single block (try to solo mine BTC on cpu now,
my lost 100BTC ) before diff recalc. With pools simplier, but it's a question in relative "loyal"/"jumping" pools
hashrate and scale of network. What the source diff recalc purpose in synthetic model(every agent
have the same hashrate)? Exactly: for network scalability.