diff --git a/Step-0%3A-ECS-Architecture.md b/Step-0%3A-ECS-Architecture.md
index dd4273f..5aeb00e 100644
--- a/Step-0%3A-ECS-Architecture.md
+++ b/Step-0%3A-ECS-Architecture.md
@@ -73,4 +73,6 @@ typedef struct MemPool
 }MemPool_t;
 ```
 The first three fields are generic fields about the memory pool. The `use_list` and the `free_list` are used to keep track of which elements are free and in use.  
-A queue is used for the free list so that each element can be used evenly. A boolean array is used to keep track of whether an element is in use. It's a bit easier on the mind doing this way although it is not as memory efficient.
\ No newline at end of file
+A queue is used for the free list so that each element can be used evenly. A boolean array is used to keep track of whether an element is in use. It's a bit easier on the mind doing this way although it is not as memory efficient.
+
+For this implementation, the buffer is _statically allocated_. This imposes a **hard limit** on the number of entities and components in the game.
\ No newline at end of file