Identic Reliability

Identic identities are reliable because of continuous checking.  Let us assume we have a person with identities with 6 organizations.  There five different data elements used for identification. The table shows the data elements in each of the organizations.

  1. A,B,C

  2. B,C,D

  3. A,B,C,E

  4. D,E

  5. A, B, C, D, E

  6. B, D, E

These are linked as follows

This structure has redundancy.  The values of A, B, C, D, E should remain the same.  The links should remain in place.  If any of the values are different they can be replaced with the most common value. If any of the links are missing they can be replaced.  The ordering of the links can be changed to make processing more efficient.  If any identity 1, 2, 3, 4, 5, 6 is removed the structure can be readjusted.  Any new node can be inserted without affecting the existing structures except the immediate links.  If all the data is missing it can be reconstructed from the organization’s copies of the data.

Identic continually monitors these structures and reports situations where there are variations and possible anomalies.  Most of these can be handled by a computer. Where a computer cannot handle it it asks the individual concerned to make a decision.

Each identity with each organization remains intact.  The loose connections between identities are structured as a set of polygons.  The polygons become a polyhedron.  This properties of the polyhedron assist in maintaining the new object made from the loose connections.  The loose connections are defined as a set of promises as in Promise Theory.  

This approach makes identity scalable while maintaining and enhancing privacy.