When selecting shards with start points in range $[-10, 10]$ in a $6F5(1)$ CMF the system hangs.
This makes sense since the system tries to enumerate $20^{11}$ points.
This means that our current method for locating shards is obsolete!
A new method should include finding the intersection (shard vertices) and looking around these.
When talking about an 11D space and specifically $6F5(1)$ this could accumulate into $\sim 2 \cdot 10 ^6$ vertices at least - but with correct optimizations this could be manageable.
Important: Such a change will impose a new major challenge - computing the new symmetries of shards between one another without using global already computed points but a single point in each shard.
For this challenge there is no clear solution and thus it is important to keep it in mind.
When selecting shards with start points in range$[-10, 10]$ in a $6F5(1)$ CMF the system hangs.$20^{11}$ points.
This makes sense since the system tries to enumerate
This means that our current method for locating shards is obsolete!
A new method should include finding the intersection (shard vertices) and looking around these.$6F5(1)$ this could accumulate into $\sim 2 \cdot 10 ^6$ vertices at least - but with correct optimizations this could be manageable.
When talking about an 11D space and specifically
Important: Such a change will impose a new major challenge - computing the new symmetries of shards between one another without using global already computed points but a single point in each shard.
For this challenge there is no clear solution and thus it is important to keep it in mind.