Talk:The Project's Data Structure

Here's a list of the abstraction layers up to the highest, each layer depends only on the previously defined layer.

Gate Matrix

The lowest level implimented in hardware as simple logic gates on a binary or q-bit foundation.

List Space

An associative memory system built on the gate matrix using the relative binary traversal model.

Node Space

• aka Nodal Core, Nodal Space

Gives meaning to various associations defined in List Space by implimenting the reduction algorithm.

Organisational Core

• aka Generic Organisation

Uses nodal reduction to define the generic organisational model which includes booking/scheduling of resources (aka RA, Resource-Allocation), accounting/budgetting of all forms of resource generically. This layer is completely functional, but has no means of communicating with other nodal spaces, and no means of persistent storage, ie its purely runtime at this stage.

Peer Space

• aka Nodal Core, Nodal Network, Network

This defines the communications between Node Spaces to form the entire shared space. This requires three organisations, Identity (GUID management), Security and Storage & Distribution, which are all defined in terms of the generic organisational core

Applicational Core

• aka Workspace, Generic Application, Application

Defines the generic application which is like a browser/explorer/finder/desktop style thing. Its based on the standard client-server methodology and defines Session which is specific instance of Workspace exhibiting specific user, stream and interface-language properties. The generic application is defined in terms of the generic organisational core, but also depends on the Peer Space components for its operation.

Software abstraction layers (from biz plan)

• Gate Space: this is the lowest most general level made of the simplest components akin to binary gates. This is a lower level than is necessary for implimentation in programming languages, this would be part of a hardware-implimentation.
• List Space: This layer uses a method called binary traversal (which is a binary-trie data structure) to create associative-array like functionality from simple components (ie no hashing algorithms etc). This layer is not used when implimented in languages which have their own native associative-arrays or dictionaries, but for lower-level languages like C or assembly language List Space is the most efficient approach.
• Node Space: This level extends the List Space functionality by implimenting the Nodal Reduction Algorithm (NRA) which defines how the space undergoes change according to its nodal content.
• Peer Space/Organisational layer: This level allows all the individually running Nodal Spaces to form a single unified Nodal Network. It does this by introducing a number of fundamental generic organisational components, and defines the wat they're used together to organise the separate peers into a unified whole.
• Applicational layer: The generic organisational components can then be used in different configurations and extended in various specialist directions through use to evolve the applicational layer.