NESTS - Named Entities in Simple Tiered Spaces

A very brief introduction to vector currency support in NESTS

The usage of the term vector currency has gradually expanded over the years as the potential applications have grown in number. The term vector is no longer adequate, but the term tensor no longer seems to add enough either. Perhaps the term compound should be preferred, but the abbreviation CC is already overused (sometimes) leading to unhelpful conflation, so for time being (not least for consistency with usage elsewhere on this site) the term "vector" will remain in use.

As ever, it is important not to conflate the meaning of currency in this context with that of money. The former is very general, referring to an variable with an application to motivate action. The latter (not least to be consistent with its use ine the context of open money) refers to a unit of account representing that a value has been agreed and recorded by both parties involved in a transaction, signifying an end to it. Such money is absolutely not a commodity and enforceable expectation is not implied in such a transaction.

Some applications of compound currency types in NESTS

A few potential applications include:


Compound currency structures in NESTS

NESTS supports a number of compound structures (vectors, matrices, n-tuples) and potentially higher-dimensional tensors.

In this section, two prototype vector currency categories are considered:



Impact vectors

Applications of the impact vector type include (but are not limited to) recording of:

The following simple example illustrates a few basic points:

Additional feedback paths can be added to update the values established earlier in the sequence, e.g.:

In the event of such a retrospective adjustment, the entire sequence following would have to be adjusted. There is not yet an obvious reason either to allow such an action by default or to encourage it. This has been added here mainly to illustrate what is practicable.

Where such a retrospective adjustment had been made, its details would be recorded in the journals of each of the entities affected.


The illustration above barely scratches the surface of what might become possible as the feedback and feedforward paths are extended and refined.

For example, the following additional paths and flows might be added:

A minimal structure

A minimal structure on which to build such an approach will now be described. The essential components here are:

\[ \begin{align} &{\textbf{v}}_i \in\mathbb{R}^n &i \ge 0 &\hphantom{\text{________}} \text{impact vector} \\ &{\textbf{v}}_{i+1} \in\mathbb{R}^n &i \ge 0 &\hphantom{\text{________}} \text{impact vector} \\ &{\textbf{u}}_i \in\mathbb{R}^m &i \ge 0 &\hphantom{\text{________}} \text{update vector} \\ &{\textbf{E}}_i &i \ge 1 &\hphantom{\text{________}} \text{expansion matrix} \\ &{\textbf{E}}_i{\textbf{v}}_i \in\mathbb{R}^m &i \ge 1 \\ &{\textbf{R}}_{i+1} \in\mathbb{R}^m &i \ge 1 &\hphantom{\text{________}} \text{ramification matrix} \\ &{\textbf{D}}_{i+1} \in\mathbb{R}^m &i \ge 0 &\hphantom{\text{________}} \text{decision matrix} \\ &{\textbf{g}}_{i+1,p} \in\mathbb{R}^m &i \ge 0 &\hphantom{\text{________}} \text{guidance vector} \\ &{\textbf{v}^{(r)}_{i+1}} \in\mathbb{R}^m &i \ge 0 &\hphantom{\text{________}} \text{ramified impact vector} \\ \end{align} \] where \[ \begin{align} m &\ge n \ge 1 \\ {\textbf{v}_{i+1}} &= ({\textbf{E}_i} {\textbf{v}_i} + {\textbf{u}_i}) \\ {\textbf{v}_{m}} &= \sum_{i = 0}^{m-1} {\textbf{E}_i} {\textbf{v}_i} + {\textbf{u}_i} \end{align} \]

The dimensions of the matrices are increased wherever necessary to accommodate the additional mappings (and obviously also to ensure conformability). Therefore, at each step the number of elements in the impact vector may grow, although the data subset selected for aggregation and attenuation may well not do so.


Acknowledgement vectors

Examples of acknowledgement vectors include:


Practical implementation

In order to simplify implementation, impact vectors, acknowledgement vectors and compensation vectors are all stored as a JSON structure in which the keys are necessarily unique and the values are written to an ordered array mapped by alphabetical order of key. The JSON structure therefore serves both to enable the mapping (and its inverse) and to store the values themselves when not being operated upon.

The ordered array (however constructed - i.e. using whatever language this component is written in) makes it straightforward to perform any required matrix operations in a very conventional way.

Wherever the number of elements in the impact vector increases, the position of the columns and rows in the mapping matrix must be adjusted appropriately within the JSON structure.




Notes:

[1] Open measure

The term open measure was suggested by Les Moore in 2018 as a generalization of the open money concept introduced by Michael Linton and his colleagues.




Version 0.1q - 2022-10-02 17.10 - Copyright © 2022 John Waters