edits the context

_posts/2021-03-03-rln-relay.md

@@ -69,7 +69,7 @@ The remainder of this post is all about the story of how to enforce this limit o
 **Threshold Secret Sharing Scheme**: (m,n) Threshold secret-sharing is a method by which you can split a secret value s into n pieces in a way that the secret s can be reconstructed by having m pieces (m <= n). The economic-incentive spam protection utilizes a (2,n) secret sharing realized by Shamir Secret Sharing Scheme[^13].
 
 # Overview: Economic-Incentive Spam protection through Rate Limiting Nullifiers
-**Context**: We started the idea of economic-incentive spam protection a year ago and conducted a feasibility study to identify blockers and unknowns. The results are published in our prior [post](https://vac.dev/feasibility-semaphore-rate-limiting-zksnarks). Since then we have made major progress and could address the prior identified blockers, namely, 
+**Context**: We started the idea of economic-incentive spam protection more than a year ago and conducted a feasibility study to identify blockers and unknowns. The results are published in our prior [post](https://vac.dev/feasibility-semaphore-rate-limiting-zksnarks). Since then major progress has been made and the prior identified blockers that are listed below are now addressed. Kudos to [Barry WhiteHat](https://github.com/barryWhiteHat), [Onur Kilic](https://github.com/kilic), [Koh Wei Jie](https://github.com/weijiekoh/perpetualpowersoftau) for all of their hard work, research, and development which made this progress possible.
 - the proof time[^22] which was initially in the order of minutes ~10 mins and now is almost 0.5 seconds
 - the prover key size[^21] which was initially ~110MB and now is ~3.9MB
 - the lack of Shamir logic[^19] which is now implemented and part of the RLN repository[^4]