Second-neighbour distance constraints.
Declared colliders.
Identity of the measured domain.
Highest absolute step a sample may integrate to.
Lattice particles, columns * rows.
The derived surface carries one vertex per particle, so this is also the drawn vertex count a render budget attributes device memory to.
Diagonal distance constraints.
Raw position and velocity bytes as 64-bit reals: 8 * 6 * particles; excludes allocation overhead and working buffers.
Row and column distance constraints.
Authored travel estimate dt · referenceSpeed / shortestStructuralRestLength, required to be at most 1 by domain admission. The shortest-edge Infinity sentinel yields 0, including no-edge lattices and direct-square distance overflow. It uses declared speed and lattice spacing rather than observed motion or collider thickness, so an admitted ratio does not certify continuous collision avoidance.
Triangles the derived surface draws: two per lattice quad.
It happens to equal shear, because a quad carries two diagonals and two triangles alike. They are separate statements about separate costs; one is what the solver projects, the other is what the GPU rasterizes; and a consumer reading the constraint count as a triangle count would be right by coincidence and wrong the moment either side changes.
Constraint gathers a worst-case seek costs.
OptionalworstSegment pairs a worst-case seek checks for a cord's contact with itself: every pair of segments that share no particle, once per sweep and step; zero for a body that does not declare it. The grid usually checks far fewer, but no lower bound holds for a cord coiled on itself.
The bounded cost a soft-body domain adds to a shot, for the builder report.
Every field is derived from the domain record alone, so a production can be refused for an unaffordable panel before a single step is integrated.