# Rise of the Resource Machines - Article Feedback

**URL:** <https://forum.anoma.net/t/rise-of-the-resource-machines-article-feedback/501>\
**Category:** Protocol Design\
**Created:** [March 8, 2024, 1:51pm UTC](https://forum.anoma.net/t/rise-of-the-resource-machines-article-feedback/501 "2024-03-08T13:51:30Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![apriori](https://dub1.discourse-cdn.com/flex013/user_avatar/forum.anoma.net/apriori/32/1655_2.png) [@apriori](https://forum.anoma.net/u/apriori)\
**Post date:** [March 8, 2024, 1:51pm UTC](https://forum.anoma.net/t/rise-of-the-resource-machines-article-feedback/501/1 "2024-03-08T13:51:31Z")

</div>

Please use this topic to provide feedback for this article by @vveiln. All comments welcome!

> **[Rise of the Resource Machines | Blog - Anoma](https://anoma.net/blog/rise-of-the-resource-machines#conclusion)**
>
> The Anoma Resource Machine (ARM) is the part of the Anoma protocol that defines and enforces the rules for valid state updates that satisfy users' preferences. The role of the ARM in the Anoma protocol is similar to the role of the EVM in the...

---

<div class="post-metadata">

**Author:** ![sean](https://avatars.discourse-cdn.com/v4/letter/s/f0a364/32.png) [@sean](https://forum.anoma.net/u/sean)\
**Post date:** [March 11, 2024, 11:00am UTC](https://forum.anoma.net/t/rise-of-the-resource-machines-article-feedback/501/2 "2024-03-11T11:00:46Z")

</div>

Nice write up of the system. It’s very clear and concise. I really like the “resource” naming, seems very intuitive.

So when user intents are created, and then matched, is there a “cron-job” constantly running checking for these matches and then a block is created if there are matches?

Or is there a set timeframe where blocks will be issued no matter what and then all matched resource intents are included in the block?

Last but not least, in regard to matching: my understanding is all matching is done in parallel to find n number of matching intents. Is there some number n where this becomes unfeasible to either a) satisfy all available matches or b) include all available matches in a single block?

This systems so cool and I look forward to learning more and playing with it!