.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
The datastructure consists of a field of dimensionless logical points in a regular geometrical array. Each point, or mote, carries with it information about its location and its relations to other motes. It also has details on its own properties, including a parameterized geometrical description of any form to which it might map and, most importantly, a history of how it came to be where and what it is. Lastly, it carries a set of rules concerned with why it is where and what it is. The mote itself does not move but its identity and properties may do so in response to some transformational activity.
The field of motes extends indefinitely and the motes which surround a particular object (a structure) have properties which can affect the environment. This means that the behaviour and performance of such a structure can be modelled in a particular environment. More significantly, the form of the structure may respond to an environment in a manner analogous to a genotype producing a phenotypic reaction. The rules of the mote may also be allowed to evolve in response to many iterative interactions with the environment.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
The entire array is recursively subdividable. A tetrahedron defined by a configuration of points in the array can be repeatedly subdivided by any convenient multiple as a self-similar array. This fractal characteristic produces significant data storage economies, but more importantly allows the model to work at several scales at the same time.
Complex spatial assemblies of motes are in turn read as the genetic code script of a seed.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.