Unfortunately, after very good mthcl's paper "Math of Nxt forging" Nxt community didn't make significal progress in Proof-of-Stake research. So me and friend of mine andruiman (having writing phd in math) decided to make some research of Nxt forging algo aiming to improve it.

While I am working with code as developer andruiman is doing math behind. I started with converting forging part of NRS code into model and described it in "Inside a Proof-of-Stake Cryptocurrency" series pt. 1 & pt. 2. andruiman went deeper into math with the model and we're happy to publish some results now:

**https://www.scribd.com/doc/243341106/nxtforging-1**For those who won't or can't read academic-like papers, here are some results we got:

1. Even in theory average delay between blocks is ~1.9 min not 1

2. mthcl's proposal is better than original algorithm though its delays distribution allows small intervals more likely and sometimes allows large intervals

3. We have own pool-in-nodes proposal which distribution looks like much more gaussian and concentrated around the desirable average = 1 min

4. We're going to make our model complex for further investigations. We're going to investigate pool-in-nodes proposal as well and think about other possible ways to improve forging

We would be happy to receive feedback & contributions

P.S. andruiman's wallet is NXT-L892-ZKXZ-2JJY-AD9JV . He will post here soon