Quorum-Based Computations on IOTA

Samuel Reid
November 03, 2018

Abstract
Qubic is a protocol for enabling quorum-based computation on IOTA. We describe a high-throughput
computational model which is tuned to balancing decentralization, latency, and trust. By implementing
sequential proof of resource and computation phases, called the resource test and qubic processing cycle, the
architecture introduces trustless quorum-based computations such as oracles, outsourced computations, and
smart contracts on IOTA. The Qubic project intends to establish a global decentralized platform available
for everyone to make new trustless applications, participate in new economic models, enable the broad
landscape of Industry 4.0 and Web 3.0, and allow for the creation of quasi-Hypercomputational artificial
intelligence which utilizes ultra-low energy distributed computing for the Fog and Mist infrastructure.

Contents
1 Introduction 3
1.1 Motivation and Use Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 Technical Specification and Intermediary Research and Development . . . . . . . . . . . . . . . . 3
1.3 Iota eXtension Interface (IXI) Modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 Qubic 4
2.1 Oracles, Smart Contracts, Assemblies, and Quorums . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.2 Decoupled Integration of Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.3 Hypercomputations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.4 The Life of an Oracle and the Life of a Qubic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.5 Minimal Messaging Incentives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.6 Cloning Qubics with Immutability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

3 The Qubic protocol 7

3.1 An Epoch: Resource Test Phase and Computation Phase . . . . . . . . . . . . . . . . . . . . . . 7
3.2 PoX Dialects in Economic Clustering for Qubic . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.3 Weighing Factor VA (Oi ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.4 Latency Factor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.5 NOT UPDATED**The Qubic programming language: Abra**ERICS QCM BLOGS INSTEAD . 8
3.6 Transaction Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.7 Modul Q Transaction Structure Using Protobuf3 . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3.8 Token/Value Transactions in Qubic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

4 Timestamping IXI 11
4.1 Deterministic Timestamping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
4.2 Non-Deterministic Timestamping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

5 Oracle Assembly Theory 11

5.1 Oracle Assembly Participation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.2 Oracle Assembly Creation Through Adjustment . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.3 Oracle Assembly Growth Maximums . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.4 Oracle Machine Representation Swaps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
5.5 Interassembly Interactions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
5.6 Quantales and Quantaloids: Complete Lattices and Endomorphism Lattices . . . . . . . . . . . . 13

1
6 Multi-Agent Distributed Consensus Smart Contract Applications 14
6.1 Introduction to Multi-Agent Systems with Distributed Data . . . . . . . . . . . . . . . . . . . . . 14
6.2 Autonomous Household Appliances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
6.3 Hazardous Material Handling Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
6.4 Distributed Reconfigurable Wireless Sensor Networks (DRWSN) . . . . . . . . . . . . . . . . . . 15
6.5 Surveillance and Reconnaissance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
6.6 Space-Based Interferometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
6.7 Formation Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
6.8 Rendezvous and Interception . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
6.9 Flocking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
6.10 Foraging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
6.11 Task and Role Assignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
6.12 Autonomous Payload Transport . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
6.13 Swarm Cooperative Search . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
6.14 Avionic Attitude Alignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
6.15 Orbit Maneuvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
6.16 Space Recycling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
6.17 Sensor Network Controls for Robot Motion Planning . . . . . . . . . . . . . . . . . . . . . . . . . 17
6.18 Programmable Matter and Claytronics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
6.18.1 Self-reconfiguring modular robots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
6.18.2 Meld . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
6.18.3 Locally distributed predicates (LDP) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
6.18.4 Distributed watchpoints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18

7 Conclusion 18

2
 ————————————————-

1 Introduction
————————————————-

1.1 Motivation and Use Cases

The realization based on the need for decentralized transparent mining as a solution to the failure of Bitcoin
(technically as an impetus for the creation of NXT, not price action wise recently which has no relevance to
this document) was a Quorum-based coin which morphed into the idea of Quorum-Based Computations (QBC)
executed as a virtual layer over IOTA, hence seeing the initial vision of Qubic requiring an intermediary step
(IOTA) to run on top of (Qubic does not rely on Jinn hardware, nor does IOTA, however the most beneficial
hardware architecture appears to be Jinn for both IOTA and Qubic).
Within the balance between decentralization, latency, and trust, there is an incompatability between the
real-time nature of applications and thus our focus on computational networks which are both decentralized
and trusted for the Qubic project leads to a natural latency that yields unrealistic regimes of application in
certain contexts (e.g., air traffic control, or other high risk activities with highly precise timing). However, there
are plenty of applications for which the risk and timing precision are sufficient for such as multiple autonomous
agent or vehicle applications without realtime precision such as autonomous household appliances, hazardous
material handling systems, distributed reconfigurable sensor networks, surveillance and reconnaissance, space-
based interferometry, and other future systems requiring multi-agent distributed consensus.
Furthermore, we require multi-agent smart contract consensus for formation control, rendezvous, flocking,
foraging, task and role assignment, autonomous payload transport, swarm cooperative search, avionic attitude
alignment, orbit maneuvers, space recycling, and sensor network controls for robot motion planning. The Qubic
project aims to provide an use of multi-agent distributed consensus networks which balance decentralization,
latency, and trust. The gradient of applications which are more of less appropriate to be using the Qubic
protocol will also be dependent upon the IXI (IOTA eXtension Interface) modules simultaneously used.

1.2 Technical Specification and Intermediary Research and Development

This document is a historical and technical reference for understanding the past, present, and future of the Qubic
project as of October 5, 2018. The year of October 2017 to 2018 was filled with ideation and conceptualization of
the Qubic architecture, implementing the visions and inventions of come-from-beyond remaining in his current
chapter of progress before focusing on the matrix, thus yieliding a practical timeline of when the Qubic project
will be entirely released in 2019, with an alpha proof of concept to be run before the end of 2018 on the
Tangle using IOTA zero value data transactions with the associated release of the LLVM JIT compiler for Abra
available on qubic.iota.org. The release of the URI processing scheme (Env + /Env0/Env− Processing Schemes)
and Q-Tangle which would constitute the Qubic beta will be released before the end of 2018 with the entirety
of the Qubic project to be finished over the cousre of 2019 so that in the 2020s Qubic will be fully functional
and operating beyond beta status with applications and use cases with scalability in academia, industry, and
government.

1.3 Iota eXtension Interface (IXI) Modules

Modul Q, as mentioned in the 2017 IOTA roadmap, is now seen to be Qubic in the context of Iota eXtension
Interface (IXI) Modules written in Abra

• Modul X - The Weighing IXI (more generally, PoX dialect resource test IXI)

• Modul Z - Abra interpreter IXI (Shiftless Haskell Modul Z and JAVA Modul Z)

• Modul Y - Timestamping IXI (rename Modul Y to Modul T? is there still a Modul T?)

• Modul V - The Virtualization IXI (Env+/Env0/Env- Processing IXI)

• Modul Q - The Q-Tangle IXI (local subtangle) with MAM2/Protobuf3

3
 The core IOTA protocol itself is purposefully lightweight and simple in nature; its role is to enable
trust free and fee-less transactional settlements as well as tamper proof data transmission. That’s
it. Staying true to universal engineering principles we reduce trade-offs through the philosophy
of modularity. Instead of creating a one size fits all swiss-army knife which invariably leads to
mediocre performance in each feature, we instead make the IOTA platform modular. This means
that each component is a stand alone application that is optimized for its purpose, without trading
off performance or functionality for other applications. Additionally, this gives users of IOTA choice
to tailor their usage of the protocol, instead of imposing the overhead of the features on, even if they
originally only need to use one of them for instance. Both of these components are imperative for a
scalable and functional platform.

-Quote, David Sonstebo, Founder of IOTA

————————————————-

2 Qubic
————————————————-

2.1 Oracles, Smart Contracts, Assemblies, and Quorums

The IOTA protocol for IoT messaging and payments is extended by Qubic to outsourced computation, oracles,
and smart contracts - which implements the QBC (Quorum-Based Computation) model described herein.
An oracle is an entity which retrieves or computes to provide data, which means that an oracle may be
another qubic or even a smart contract. An oracle machine is the device or algorithmic instantiation (in a
non-device context, e.g. proof of biometrics) which runs qubics to act as an oracle or compromise one of many
oracle machines which represent the oracle. Since oracles naturally have varying degrees of trust, we define
consensus through a 2/3 quorum of oracles executing the Qubic Computational Model (QCM).
An Assembly is a group of oracles which are entering into a resource test for initiating Qubic Processing
for the associated rewards proportional to the weighting generated for the oracles by the true output of the
oracle machines during the resource test. In an assembly, oracle data may be retrieved from other assemblies
(of potentially less trusted oracles), and in order to obtain rewards for processing qubics a user would need to
have had the revealed data of their oracle(s) agree with the 2/3 quorum. In the case of oracles working for
rewards, the cost, electricity, and capital access should be proportional to the rewards in a non-exploitative
sense so as to balance out or perhaps gift a non-excessive premium of rewards on the cost/electricity/capital
usage or access. This incentivizes retrieving trusted oracle data as unreliable reveals will likely not be rewarded
as that data will likely not agree with the 2/3 quorum and not be provided rewards. The strength of trust in
an assembly and reliability of the oracle data revealed can be analyzed in practice and an experimenting with
initial implementation will be required to understand how socioeconomic factors and real-world factors that
cannot be simulated practically to interact with the Qubic protocol for smart contracts which can be written
and executed with active data collection and value transactions rewarding oracles participating in an assembly.

2.2 Decoupled Integration of Computation

Observe that the formation of a quorum on a result may be decoupled from continuation of processing for
vertically integrated tasks, resulting in a maximum throughput with no bounds (asynchronous), and a latency
limited only by the slowest of the minimum to form a quorum; that the incentive to quickly self-include into
a quorum exists such that one maximizes the probability to receive a reward, results in naturally minimized
latencies.
This decoupling of the continuation of processing from the formation of a quorum provides the innovative
add to the architecture which is of technical interest in terms of architecture decision-making.

2.3 Hypercomputations
Super-Turing-Complete Tasks could be computed using qubic which provides the first potential implementation
of a random oracle computer. Latency (time between effect broadcast and first result broadcast) of the quorum
needs to be discussed as well as distributed fuzzy logic. We conjecture that the Σ01 and Π01 recursively enumerable
formulas are computable with qubic, which implies that qubic could compute super-turing-complete tasks. An
oracle for the halting problem for oracle machines with an oracle is a Turing jump. A set X and a Gödel
0
numbering φX i of the X-computable functions yields the Turing jump X of X defined as

X 0 = {x | ϕX
x (x) is defined}.

4
The nth Turing jump X(n) is defined inductively by

X (0) = X,

X (n+1) = (X (n) )0 .
That is, the problem X 0 is not Turing reducible to X. Post’s theorem establishes a relationship between the
Turing jump operator and the arithmetical hierarchy of sets of natural numbers. The set of Turing machines
which halt on access to an oracle which solves a specified problem is the Turing jump associated with that
problem. Therefore, super-turing-complete tasks can potentially be achieved through qubic in terms of clus-
tering the processing power of oracle machines. The arithmetic hierarchy of sets of natural numbers can index
with Σ0n+1 and Π0n+1 formulas which can provide clustering of oracle machine computability regimes. Oracle
assemblies with nearby computability regimes.

2.4 The Life of an Oracle and the Life of a Qubic

An oracle is composed of a set of oracle machines which provide the sum total of computations provided by that
oracle. An oracle’s life begins with a null state, waiting for arrival of inputs running from a qubic running in an
assembly that the oracle has joined or created. Throughout the life of an oracle, it will continue computing qubics
during the sequential proof of resource phase and computation phase, by which it can post qubic adjustment
transactions (WATCH OUT: make sure to define qubic adjustment transactions!) and then compute or wait for
the end of the epoch at which point rewards will be provided to the participating oracles according to a weight
we discuss later.
Rather than an example of a qubic, we describe pseudocode for how a qubic runs:

Algorithm 1 Lifecycle of a qubic running

1: Prepare a qubic for processing
2: Make a reward-offering decision associated with the qubic
3: Choose an Assembly for the qubic
4: Attach the qubic to an assembly or specific epoch of that assembly
5: Wait and then process the qubic when the assembly starts
6: Gather commits from processing results of the qubic
7: Quorum consensus evaluation of the qubic
8: Gather reveals from processing results of qubics
9: Reward quorum participants for the qubics results which had consensus

Input data triggers qubics to run and thus qubic nodes work as dispatchers with input data for a qubic
becoming available and run by all oracles in the assembly. It is the choice of the creator of the qubic who posts
the qubic transaction to the tangle for initiating an oracle assembly to compute the qubic, and provide the
decisions made associated with the qubic running.

2.5 Minimal Messaging Incentives

Question: With associated weights we describe (and show that) the number of messages to come to a quorum on
a result can be minimized because of the non-homogeneous weights, show that the incentives move to maximizing
one’s own weight to maximize received reward tokens.
For S.P. How do we rephrase?
-BEGIN PROOF SKETCH- There are two types of people representing oracles in a qubic assembly. Firstly,
there are people who will commit and thus have an incentive to post and reveal, and secondly, there are people
who will not commit and thus will not need to reveal. Everyone wants to minimize the number of messages
they post to the tangle and also to maximize the reward they receive. We only practically require one person
to reveal the answer but the simultaneity of their commit being revealed in line with the Quorum. Everybody
wants their commit in the Quorum, but no one wants to reveal because it is another message. They also want to
reveal as soon as possible to ensure that they are included in the entire assembly. Therefore, people representing
oracles have incentives to maximize their own weight to maximize their rewards. -END PROOF SKETCH-

2.6 Cloning Qubics with Immutability

"How do we prevent someone from just publishing a new Qubic that uses the previous Qubic’s state as part
of its inputs because they know that that one will be executed for free as well?" Correlation a rainbow look
up table of filtered inputs for concurrent qubic states and clone filtering of qubic author based on clique and
network connectivity and filtered input correlations & timestamping on a poset which keeps track of those qubic

5
author & input filter pairs can provide a dominance ordering on which the detection validates which was the
cloned copy unjustly running and which was the seed qubic from which the cloned copy sprouted and needed
a verification check on. Once the verification check has completed that "non-cloned copy qubic" could perhaps
have a metadata tag associates with it ensuring it is the source qubic with an attempted clone failure recorded
for ensuring a legitimacy or accumulation of a qualitative reputation for ensuring sustainability of the original
author’s qubic - not these clone and ghost copies running away with it.

6
 ————————————————-

3 The Qubic protocol

————————————————-

3.1 An Epoch: Resource Test Phase and Computation Phase

The Qubic protocol standardizes the ways in which to specify and request outsourced computation tasks. It
uses the IOTA protocol for communication between the various participants, allowing for decentralized and
secure processing. Using the IOTA protocol as a payment system, incentive can be provided to participants
through rewards with the threshold and settings for these rewards set by the publisher of a qubic transaction
(which provides instructions on how and when to process the qubic - with tasks specified in an intermediate
ternary-based functional programming language called Abra). Oracles read qubic transaction meta data and
then decision making can occur for participating in computing that qubic with an assembly of oracles.
The Qubic Epoch is the Resource Test Phase and Qubic Processing Phase. An Epoch is the real world time
period it takes to execute a single cycle of a resource test phase followed by a qubic processing phase. The
initiator of an assembly posts global parameters of the assembly and other oracles then join.
As an anti-Sybil measure we introduce a Resource Test Phase at the start of each epoch. The epoch
parameters will specify how long the resource test phase will last for as well as Proof of Stake to Proof of Work
ratios and initial parameters associated with a Q-Variable Transaction data type. The results will not only
show uniqueness of each oracle as an entity, but will also show the computational capabilities of each oracle in
the form of a weighing factor.
We can introduce a variable PoW+PoS resource test and more generally a variety of other “Proofs”, including
Proof of Biometrics (e.g. fingerprint), Proof of Ownership, Proof of Identification, Proof of Sale, or any other
Proof of X system (PoX).

3.2 PoX Dialects in Economic Clustering for Qubic

The notion of PoW dialects has been introduced internally in relation to Economic Clustering. The simplest
example of a dialect is a change to the PoW such that we pick a different hash to collide with instead of the
null hash.
Borders are fuzzy in economic clusters and PoW dialects may help to mitigate this issue. Dialects al-
low for cluster-specific transactions to be prioritized within overlapping clusters, while transactions from non-
neighboring clusters need not reach these overlapping clusters for lack of a shared dialect.
To clarify, a version of PoX (e.g., PoW, PoS, Proof of Bandwidth) acceptance could be used to form a
fuzzy boundary between economic clusters. Dependent upon the PoX there is the possibility for many distinct
dialects (PoX dialects). The variation of PoX dialects may be used in Qubic to achieve cluster-related acceptance
together with resource testing. However, the implementation details associated with a particular PoX dialect
may have implications on network security, user and oracle access and identity, and other aspects of the Qubic
processing phase.
Regardless of which PoX dialect is implemented with Economic Clustering, the Qubic protocol will require
a resource test as both an anti-Sybil measure, and as a way to separate epochs and recheck the participation
of all the oracles in the assembly. The most straightforward approach would of course be to use the standard
dialect (IOTA PoW).

3.3 Weighing Factor VA (Oi )

Let A = (O1 , ..., ON ) be an N oracle assembly, where
ki
M
Oi = Oi,j
j=1

is the ith oracle with oracle machines Oi,j for 1 ≤ j ≤ ki , where i, j, ki ∈ N+ . Then the ith oracle Oi has the
following weighing factor (vote proportionality of the assembly):
ki Z
X t0 +RTD
POW(Oi,j (t))dt
j=1 t0
VA (Oi ) = ki Z
XX t0 +RTD
POW(Oi,j (t))dt
i=1 j=1 t0

7
 N
X
where VA (Oi ) = 1, and POW(Oi,j (t)) is the amount of proof-of-work done by the oracle machine Oi,j at
i=1
time t ∈ [t0 , t0 + RTD], and RTD is the Resource Test Duration.

3.4 Latency Factor

The latency factor of an assembly

Latency(A) = min{BERTD − BR∗i | 1 ≤ i ≤ N }

is the minimum of the time difference between the broadcast effect (BERTD ) and the first broadcast response
(BR∗i ) associated with the ith oracle provided it was the first broadcast response, although the minimum latency
of an oracle assembly can be achieved by more than one oracle.

3.5 NOT UPDATED**The Qubic programming language: Abra**ERICS QCM

BLOGS INSTEAD
Abra is an ’intermediate ternary-based functional programming language’, to ensure hardware independence
and ease of translation and interpretation, and is less powerful than Abracadabra from the Jinn Computation
Model.
Abra exists within the dataflow programming paradigm in that the model of a program is through a directed
graph of data passing between operations. Furthermore, the way data flows through a qubic, which is supported
by Abra, achieves wave pipelining, which is that data can flow through the several stages of the processor
without the need for synchronization or buffering delays. Wave pipelining should be able to achieve clock-rates
2-to-7-times those possible with conventional pipelining systems.
Ultimately, there are no instructions in Abra, there are only descriptions of dataflow.
Abra is a trinary, reactive, dataflow-oriented, single-dimensional array-based, functional assembly language.
Abra on its own only has a couple of functions which exist for the purpose of the supervisor. (Definition:
The supervisor is a circuit or process which takes effects generated and sends them to environments.)
Primarily, there is broadcast. Broadcast is a function which accepts an environment, a delay, and an effect.
It triggers the supervisor to send an output of one qubic to the input of a qubic in the declared environment.
There are special functions included on top of this, leave, join, and decay. They are broadcast messages to
the supervisor; leave and join take environment literals, and join also takes an integer to the receive input.
receive is a function which returns an effect. It is used by the supervisor circuit, or process, to feed inputs to
a qubic. It has a maximum number of invocations for which it can be called. These data are changeable, but
belong in a metadata section for a qubic. Its first argument is an integer associated with environments (which
may be listed in metadata).
As far as the functions in the middle, they are ultimately composed of input mergers and lookup tables. A
lookup table is a type of function which specifies the input values and results for which it is defined. For all
other input values, it returns null. Thus, it can be declared as an array.
By attaching a decryption process to a function, which hints to the executor of the function that all inputs
must be non-NULL for the returned value to be non-NULL we are able to have Abra short-circuit functions
that would obviously return NULL when only one parameter is NULL.
Furthermore the NULL value arriving to a state trit doesn’t change the stored value, it is like a trinary latch
that ignores the input if the input is NULL.

3.6 Transaction Structures

A global variable transaction is used to form an assembly. It must be searchable so that prospective participants
may find and parse it, and make a determination as to whether they will join the assembly, or attach a qubic to
it. Thus, the address and/or tag must consist of or contain some expected value. The payload would consist of
a map of [ variable name : value ] The first declaration would be the trit-length of the payload, and then each
mapped item would have: [ name length, name, value length, value ] So overall, we would have a flat buffer
with: [ length of payload, [ [ name length, name, value length, value ] . . . ] ]
The community will eventually be provided with a Github repository to run a Qubic-enabled node and view
open-source code associated with the architecture and implementation of Qubic for public release. Additional
inputs, parameters, and/or constraints required for optimizing the architecture of Qubic may differ from the
present inception and detailing, but the main conceptual paradigm and implementation focus and vision are
contained herein.
The following types are archetypal for providing Variable, Commit, Reveal, Entity, and Qubic Transaction
detailing as a hint to the structure of Qubic as a virtual transaction layer over the Tangle with oracle machines

8
computing tasks of a local q-DAG (a local subtangle of q-Tx’s running on the oracle machines of an oracle in
the assembly).
A Q-Variable Transaction is a data type which provides the necessary integers, strings, and hashes to provide
inputs for initiating a qubic which is run by an assembly.

Q-Variable Transaction
1. Q-Variable Parent Hash
2. Start Time
3. Epoch Duration

4. Resource Test Duration

5. Q-Variable Stakes
6. Q-Variable Hash

7. Address of Parent Quorum Hash

8. Extra Data Digest: Self Quorum Hash
9. Checksum Tag
A Q-Commit Transaction is a data type which provides the necessary inputs, hashes, and signature required
for an oracle committing a result which it has computed to provide to the oracle assembly.

Q-Commit Transaction
1. Hash of Inputs

2. Output Hash
3. Salt Hash
4. Salted Hash
5. Merkle Signature

6. Environment Hash
A Q-Reveal Transaction is a data type which provides the necessary strings and hashes for revealing the
committed result from computing which are revealed to the oracle assembly for obtaining consensus.

Q-Reveal Transaction

1. Q-Value String
2. Q-Commit Reference Hashes
3. Q-Reveal Hash

4. Address of Q-Committed Hash

5. Extra Data Digest: Environment
A Q-Entity Transaction is a data type which provides the Abra code and entity hash to provide the infor-
mation to execute intermediary ternary-based functional programming based on a compiler for which there is
ease of Verilog/VHDL translation and FPGA implementation, as well as leads to amenable translations for x86
processors and other ARM architectures unrelated to the potential for Jinn hardware applications.

Q-Entity Transaction
1. Q-Entity Abra Code String

2. Q-Entity Hash

9
 A Qubic Transaction requires a QBC Entity, QBC Assembly, and QBC Metadata, for which further archi-
tecture details will be provided in relation to q-Tx’s and q-DAG structure.

Qubic Transaction

1. QBC Entity Hash

2. QBC Assembly Hash
3. QBC Metadata Hash
The Qubic Protocol transaction types are presently being implemented with the Java interpreter of Abra
and the shiftless Haskell interpreter of Abra in the iotaledger QBC library.

3.7 Modul Q Transaction Structure Using Protobuf3

BSU showed that the format of IOTA transactions can be implemented using ProtoBuf3.

message Transaction {
required tryte signatureMessageFragment [2187];
required tryte address [81];
required long long trint value ;
optional tryte obsoleteTag [27];
required trytes timestamp ;
required trint currentIndex ;
required trint lastIndex ;
required tryte bundle [81];
required tryte branchTransaction [81];
required tryte trunkTransaction [81];
required tryte attachmentTag [27];
required trint attachmentTimestamp ;
required trint attachmentTimestampLowerBound ;
required trint attachmentTimestampUpperBound ;
required tryte nonce [27];
}
where ProtoBuf3 uses additional types to the ProtoBuf data types and language constructions listed below:

– null: a special type that describes nothing and is encoded by the empty word;
– tryte: an element of T3. Interpreted as an integer, takes values in the range [−13, 13];
– trint: an element of T9. Interpreted as an integer, consists of 3 trytes, takes values in
the range [−9841, 9841];
91
– long trint: an element of T18. Interpreted as an integer, consists of 6 trytes, takes
values in the range [−193710244, 193710244];
– long long trint: an element of T27. Interpreted as an integer, consists of 9 trytes,
takes values in the range [−3812798742493, 3812798742493];
– trytes: an array of trytes. The length of the array is implicitly encoded before the array
elements;
– T arr[n]: an array arr of n elements of type T;
– T arr[]: an array arr of elements of type T. The array can be placed only at the end of
a data object. Elements of arr are continued until the end of the object. The number of
elements is not fixed during encoding, it is determined indirectly during decoding. Note
that this field does not have any modifiers.

A special data definition language called ProtoBuf3 was developed by BSU. It is based on the wellknown
Google Protocol Buffers notation. ProtoBuf3 supports ternary streams. ProtoBuf3 contains cryptographic
elements with the help of which one can quite easily describe the cryptographic processing of messages such as
Q-Tangle transactions with MAM2 channels.

10
3.8 Token/Value Transactions in Qubic
Third party gateways hold the real assets. They report deposits, inflating supply of pegged USD/EUR, and
fulfill withdrawals, deflating supply of pegged USD/EUR.
Quorums decide what happened, and inform what should be done.
Minting coins is possible (but not Nash) in blockchains following longest-chain-rule-based leader-selection,
and also in quorums, where the number of participants is bounded. But IOTA follows a bivariate graph with
monte-carlo tip selection regime. Of course, any tip selection algorithm may be used, but the selection rule
needs to satisfy Nash. If we were to introduce minting into this, then we create a conflict between cumulative
weight and minimum dilution of supply. We presume that users want to take advantage of IOTA because they
want data integrity and to transfer money.
Say that we desire to have a predictable rate of supply increase. In order to satisfy this, you must add only
as much as the rate allows, onto the subtangles you reference. Thus, your incentive is to select the narrowest
subtangles rather than the highest weight subtangles.
If there is a large amount of “miners” in this system, their incentive is to maximize the weight of the subtangle
under which they get the highest amount mined. Two subtangles that mint new coins at a rate higher than
what is allowed by protocol cannot be merged.
The Payment Services Directive (PSD, Directive 2007/64/EC, replaced by PSD 2, Directive (EU) 2015/2366)
is an EU Directive, administered by the European Commission (Directorate General Internal Market) to regulate
payment services and payment service providers throughout the European Union (EU) and European Economic
Area (EEA).
Using PSD2 and an API specification for Revolut, transferwise, and n24, it could allow other applications
the same access for fiat pegged gateways.
If you take IOTAs in a PoS resource test and then oracles are asked to provide information in a signed manner
for the execution of that information, then given that the IOTAs are from a known source and comply with
KYC/AML/CTF aspects of funds transfer, the fiat funds can be moved through participating in an assembly
wherein oracles can also be filtered by IOTA address seed sources for differentiating price of execution.
————————————————-

4 Timestamping IXI
————————————————-

4.1 Deterministic Timestamping

Tangle timestamps have fuzzy borders and any timestamp has a declared time, and upper and lower bounds of
precision/accuracy, expressed by
Ti = Tdeclared − ∆T
where this is not only declared upper and lower bounds, but observed confirmation intervals with different
choices yielding different confidence intervals. Define an index of parameters λij = ∆Ti − ∆Tj , where i, j ∈ N
for the differences of confidence intervals between the two (does this address the time it takes to compute the
two?)
Should the β parameter of Procedure 1 in Popov’s timestamping memo provide a global variable for the
assembly and it is required for the creator of the qubic transaction which initiates the assembly to post on the
Tangle?

4.2 Non-Deterministic Timestamping

By providing Procedure 2 of the Popov memo using random walk techniques we can use less computational
power to find a lower resolution of confidence in accuracy.
————————————————-

5 Oracle Assembly Theory

————————————————-

11
5.1 Oracle Assembly Participation
Let
lω M
M ki
Pω := Oi,j
i=1 j=1

be lω oracles which one person controls. Then there are at most lω oracle assemblies which Pω can participate
in and lω has a practical maximum number of assemblies it can join in terms of latency of assemblies.

5.2 Oracle Assembly Creation Through Adjustment

Any oracle participating in an assembly can attach a Qubic Adjustment transaction to the Tangle at any time
which references the assembly and proposes changes to the global variables of the assembly. Let χ be the
characteristic function which outputs 1 if an oracle votes yes to an adjustment and which outputs 0 if an oracle
votes no to an adjustment. Then consider the following algorithm for executing up to K adjustments to the
oracle assembly which could create up to K new oracle assemblies (if all adjustments reached quorum) - i.e.,
there is not only adjustment which can be made.

Algorithm 2 Qubic Adjustment Transactions for Oracle Assembly Creation

1: function Qubic Adjustment Transaction(O1 , ..., ON ) . [Adj1, ..., AdjK], N, K ∈ N
2: for Q = 1 to K do
3: Set Quorum Threshold VQ = 0
4: for i = 1 to N do
5: if χ(VA (Oi ), AdjQ) = 1 then
6: Set Quorum Threshold VQ = VQ + 1 . Oracle Oi Votes For Adjustment
7: else if χ(VA (Oi ), AdjQ) = 0 then
8: Set Quorum Threshold VQ = VQ . Oracle Oi Votes Against Adjustment
9: end if
10: end for
11: if VQ /N > 2/3 then
12: Create an Assembly from AdjQ
13: else
14: Do not create an Assembly from AdjQ
15: end if
16: end for
17: end function

Through providing accountability, transparency, and trust, to the VQ counter relative to the number of
oracles in the assembly, we can have consensus upon adjustments for the creation of new oracle assemblies for
which the choice to split into participating in the resource test of any of the newly created oracle assemblies,
and retaining the possibility of all proposed adjustments not reaching quorum and there being no adjustments
to the oracle assembly.

5.3 Oracle Assembly Growth Maximums

By defining the following parameter

Qmax (A) := Latency(A)(ED(A) − RTD(A))

we can see the growth rate increase associated with an assembly and also consider a global parameter over all
oracle assemblies:
XNs Z ts Z(t
Xs )
GlobalQ(s) := Qmax (As,r
q )dts
r=1 0 q=1

with the maximum number of oracle assemblies that Qubic could run by time t after the initiation of Qubic:
Z t Ns Z
Z tX ts Z(t
Xs )
Qubicmax (t) := GlobalQ(s)ds = Qmax (As,r
q )dts ds
0 0 r=1 0 q=1

12
5.4 Oracle Machine Representation Swaps
0
Let Oi be an oracle and let Oi be another oracle. Then,
ki
M
Oi = Oi,j
i=1

and 0
ki
0 M 0
Oi = Oi,j
i=1
0 0
with maps Oi,1 7−→ Oi,1 to Oi,ki 7−→ Oi,k0
i

5.5 Interassembly Interactions

In a multi-oracle and multi-assembly environment there are interactions between assemblies which can occur.
These interactions inheret all properties of category theory where create the category of assemblies Asmb where
objects in the category Asmb are assemblies

A1 , ..., AQubicmax (t) ∈ Ob(Asmb)

and morphisms are functions between outputs of assemblies and inputs of oracles into assemblies. Composition
of morphisms makes sense, and if you let f and g be two morphisms in the category of assmeblies Asmb then
we have that if f : a → b, g : b → c and h : c → d then h ◦ (g ◦ f) = (h ◦ g) ◦ f, and also for morphisms in the
category of assemblies Asmb, for every Assembly A, there exists a morphism 1A : A → A (or in other notation,
idA : A → A) called the identity morphism for A, such that for every morphism f : a → A and every morphism
g : A → b, we have 1A ◦ f = f and g ◦ 1A = g (or in other notation, idA ◦ f = f and g ◦ idA = g). Now,
forming functors between morphisms and natural transformations between functors, we can see the semblance
to higher category theory forming, as well as the bijection between layers of mist infrastructure with Jacob
Lurie’s (∞, 0), (∞, 1), (∞, 2), ..., (∞, n) categories, and that the fog and mist infrastructure layers resemble the
structure of a tree, where the fog layer is near the trunk and that as it spreads down, that either a fractal root
system or leaf system resemble fractals as in the asymptotic mist infrastructure which is when n → ∞. Qubics
interassembly interactions are able to virtually simulate the fog and mist infrastructure, dependent upon looking
at functors in the case of fog infrastructure, and natural transformations in the case of mist infrastructure. In
the limit of infinitely many devices in the City in the Sky, an asymptotic mist infrastructure is achieved as the
implementation of (∞, ∞)-category computing.

5.6 Quantales and Quantaloids: Complete Lattices and Endomorphism Lattices

[Reference: Rosenthal, Kimmo I. (1996), The theory of quantaloids, Pitman Research Notes in Mathematics
Series, 348, Longman, Harlow, ISBN 0-582-29440-1, MR 1427263] Within the
In mathematics, quantales are certain partially ordered algebraic structures that generalize locales (point
free topologies) as well as various multiplicative lattices of ideals from ring theory and functional analysis (C*-
algebras, von Neumann algebras). Quantales are sometimes referred to as complete residuated semigroups. A
quantale is a complete lattice Q with an associative binary operation ∗ : Q × Q → Q, called its multiplication,
satisfying a distributive property such that-
_ _ _ _
x ∗ ( yi ) = (x ∗ yi )x ∗ ( yi ) = (x ∗ yi )
i∈I i∈I i∈I i∈I

and
_ _ _ _
( yi ) ∗ x = (yi ∗ x)( yi ) ∗ x = (yi ∗ x)
i∈I i∈I i∈I i∈I

for all x, yi ∈ Q, and i ∈ I, where I is any index set.

In mathematics, a quantaloid is a category enriched over the category Sup of suplattices. In other words for
any objects a, b the morphism object between them is not just a set but a complete lattice, in such a way that
composition of morphisms preserves all joins:
_ _ _ _ _ _
( fi ) ◦ ( gj ) = (fi ◦ gj )( fi ) ◦ ( gj ) = (fi ◦ gj )
i j i,j i j i,j

The endomorphism lattice Hom(X, X) of any object X in a quantaloid is a quantale, whence the name.

13
 Every assembly is a complete lattice Q and thus the structure of all assemblies running is a Quantaloid with
a finite approximation of a fractal within the quantale (endomorphism lattice) of Q.
————————————————-

6 Multi-Agent Distributed Consensus Smart Contract Applications

————————————————-

6.1 Introduction to Multi-Agent Systems with Distributed Data

There are a variety of applications which Qubic is useful for related to multi-agent systems and the ability to have
a local subtangle associated with IoT network processing for outsourced heavy computing, distributed consensus
amongst multiple autonomous agents, and the ability for smart contracts in the sense of a distributed ledger
technology interactive code (Abra) which has a functionality for generating and translating to optimized and
associated efficient hardware choices (such as Abra to FPGA translation or Abra to LDP/MELD Translation
(later to see Programmable Matter and Claytronics)).

6.2 Autonomous Household Appliances

Autonomous Appliance Scheduling for Household Energy Management
Christopher O. Adika ; Lingfeng Wang
https://ieeexplore.ieee.org/document/6576287
The advancement of renewable energy technologies has seen the emergence of customer owned grid
tied wind and solar microgrids. These microgrids offer an opportunity to energy users to lower
their energy costs as well as enabling the power suppliers to regulate the utility grid. However, the
integration of the renewable energy based sources into the smart grid increases the complexity of
the main grid. The success of this scheme will be heavily reliant on accurate real-time information
exchange between the microgrid, the main grid, and the consumers. The communication between
these agents will be critical in implementation of intelligent decisions by the smart grid. The micro-
grids will be required to relay energy forecasts information to the utility grid. Similarly, customers
will be expected to submit energy demand schedules, to actively monitor energy price signals, to
participate in energy bids, and to respond to energy management signals in real time. This kind of
grid-user interaction will be overwhelming and could result in consumer apathy. There is therefore a
need to develop smart systems that will autonomously execute all these tasks without the prompting
of the customers. This paper presents one such approach. In this study, we proposed a demand side
energy management for a grid connected household with a locally generated photovoltaic energy.
To ensure efficient household energy management, smart scheduling of electrical appliances has also
been presented.
Published in: IEEE Transactions on Smart Grid ( Volume: 5 , Issue: 2 , March 2014 )

6.3 Hazardous Material Handling Systems

Beyond Global HazMat, Materials Handling and Storage systems, and WHMIS/WSPS training and guidelines,
the following industries have a high incidence of lost-time injuries where there is a history of non-compliance:
• Ceramics, glass and stone
• Chemical, rubber and plastics
• Wood and metal fabrication
• Automotive
• Construction premises
• Building supply centres
• Food beverage and tobacco
• Pulp and paper
• Textiles and printing
By improving Hazardous Material Handling Systems with IoT sensors and the Qubic protocol for multi-agent
distributed consensus, many workplaces in relation to the above industries may have improved safety.

14
6.4 Distributed Reconfigurable Wireless Sensor Networks (DRWSN)
We improve RWSN to DRWSN leveraging "Reconfigurable Wireless Sensor Networks new adaptive dynamic
solutions for flexible architectures" by Hanen Grichi, Olfa Mosbahi, and Mohamed Khalgui:

This paper deals with reconfigurable wireless sensor networks RWSN that should be adapted to
their environment under user and energy constraints. A RWSN is assumed to be composed of a
set of communicating nodes such that each one executes reconfigurable software tasks to control
local sensors. We propose three reconfiguration forms to adapt a RWSN: (a) software reconfigu-
ration allowing the addition/ removal/ update of tasks, (b) hardware reconfiguration allowing the
activation/deactivation of nodes, (c) protocol reconfiguration allowing the modification of routing
protocols between nodes. We propose a zone-based multi-agent architecture for RWSN where a
communication protocol is well-defined to optimize distributed reconfigurations. Each agent of this
architecture is modeled by nested state machines in order to control the problem complexity.

Published in: 2014 9th International Conference on Software Engineering and Applications (ICSOFT-EA)

6.5 Surveillance and Reconnaissance

Multi-agent consensus on surveillance through multiple networks.
Triangulation of information for reconnaissance verification.

6.6 Space-Based Interferometry

Observation of the Earth from space is important for a variety of societal aspects and factors ranging from
security to weather, and decision-making at intergovernmental levels is briefed by climate monitoring and Earth
atmosphere observation (in-situ with drones or air balloons, as well as with ground based observatories and
devices, and space based devices), and Earth subsurface observation. One of the most comprehensive techniques
for Earth observation is Space-Based Interferometry, because electromagnetic radiation interference phenomena
are ideal for accurately remote sensing with precision.
Within a constellation of satellites C = {c1 , ..., cn }, there can be a variety of measured interferometry results
and it can be communicated with the Qubic protocol what the consensus is amongst satellites c1 , ..., cn in
the constellation by treating each satellite as an oracle. There can be qubic adjustment transactions out of the
Qubic committee formed by the constellation wherein varying decisions or geographic regions can be partitioned
for better accuracy, precision, or consensus, on the agreement of the results associated with the oracle outputs
representing c1 , ..., cn .

6.7 Formation Control

Formation control is important for ensuring positioning and location over time for cars, robotic manufacturing
control systems, Nanosatellite constellations, UAV drones, lunar rover formation, and a variety of other systems
I don’t have time to finish writing about right now.

6.8 Rendezvous and Interception

Aligning with a moving target for maintaing the same intertial reference frame can be done with a virtual
oracle representing the target reporting it’s own observations that are post-facto imposed on that virtual oracle.
This is an interesting case of a trivial assembly wherein the Qubic protocol is employed on a level that is so
local that it is only one participant large with two other virtual participants allowing for 2/3rds consensus
between if the virtual participant and the participant agree or not whilst implementing the Qubic protocol
over IOTA for post-quantum-security of the transactions such that post-facto the report provided by the data
transmission (internally) is still auditable as is the purpose of a ledger (which can be locally occuring in a
subtangle before publically attaching again - this is achievable with MAM streams as well in certain contexts or
other Protobuf3 schemas which can be also how the Q-Tangle (virtualization layer of the Tangle) speaks with
the Tangle post-quantum-securely off of an NTRU platform basis as well.

6.9 Flocking
Birds flock. Why do birds flock with each other in a flying V? They are communicating with each other in a
coherent state for flocking - we will see UAV drone swarms do this more and more in the future. A world without
flocks of autonomously moving IoT vehicles and devices will soon be a thing of the past, it is inevitable in the
emergence of artificial general intelligence and AIgarth will aid in the backbone of AI smart contract execution

15
and maintenance. IOTA is the backbone of Qubic and Qubic is the backbone of AIgarth which is the backbone
for flocking of autonomous IoT vehicle and device networks. This will also be required for autonomous payload
transport to have flocking considerations in mind so that interspersed payloads (in ground vehicle fleet flocks, ,
flying aerial vehicle flocks such as the Boeing flying taxi to be released, or space transport and vehicles).

6.10 Foraging
Let F = {f1 , ..., fn } be a set of n foragers which need to be collaboratively communicating on search and locate
aspects for objects which have certain metadata tags. There is then a goal of oracles interfacing with each of
the foragers which is that they must provide the correct information which more likely leads the foraging team
to acquire what they are looking for. There are various examples of this which can be used in practice, such as
a team of government agents attempting to apprehend a criminal on an investigative case or a group of bears
searching together in the forest for Berries. It is a rather practical and mundane consideration of team resource
gathering and acquisition determinations which lead to the task of foraging in a committee to be a relevant
application for Qubic, especially as in many of these scenarios there is not that urgent of a time sensitivity on
latency of communication or frequency of communication in that it can operate in a rather radar-based sense
to take naval operations as a basis point for radar search-and-rescue missions as another concrete example of
foraging.

6.11 Task and Role Assignment

Oracle can provide results to assign tasks with a consensus gradient that is thresholded in the initial metadata of
the committee. In particular, the question to be determined can be a vote or leveraged vote in any sense wherein
the committee is asked, "What do we think of these task and role assignment choices"?. Oracle provide answers
which with a gradient of consensus in the metadata parameters decides the qubic adjustment transactions can
occur for each distinct arrangement of answers to this table of questions which can be implented very efficiently
with magic square overlap of combined 2p + 3q mixed base complement factors that can partition both devices
and participants into the appropriate follow-up qubic committee (assembly = committee) dependent upon
binary or trinary hardware usage. The oracles answers to what they all think of these task and role assignment
choices causes forks of behaviour and population wherein the incentivized behaviour associated with the desire
to continue participating in the committee is either determined or not. Organically there will be dying off or
continuation of various qubic adjustment transaction chains that allow for a central stabilized consensus decision
amongst the IoT networks and devices associated with these local subtangles.

6.12 Autonomous Payload Transport

Let P = {p1 , ..., pn } be a set of n payloads to be transported autonomously between locale 1 and locale 2
which are considered to be points m ∈ M and n ∈ N which are two manifolds. The autonomous payload
transport space can be the moduli space of transport paths of n payloads between m in manifold M and n
in manifold N . Generally, dim(M) = dim(N ) = 3, and in fact, in most scenarios we would have M = N
as this represents the scenario of robot motion planning for three dimensional real (in the number theoretic
sense, and practical physical sense) space. There is a simplicial moduli space associated with the configuration
space of autonomous payload transport motion planning and the flip graph of all states can keep track of
the combinatorial possibilities that each have their own associated distance parameters dependent upon the
manifolds and points.

6.13 Swarm Cooperative Search

Let S = {s1 , ..., sn } be a set of n swarm IoT devices which communicate with each other in a local IoT network
needing to utilize the Qubic protocol for ensuring there is a post-quantum secure local subtangle vehicles/devices.
A ground swarm of ATV self-driving vehicles, or a UAV swarm of aerial vehicles, could be examples of swarm
cooperative search engagements that could even be partitioned into
[ [
S = SATVs SUAVs SHUMs

as an example of n = 100 wherein there are 10 ATVs with 40 HUMs and 50 UAVs such that s1 , ..., s10 represent
the oracle output of an IoT device representing the identity of an ATV, s11 , ..., s60 represent the oracle output of
an IoT device representing the identity of a UAV, and s61 , ..., s100 represent the oracle output of an IoT device
representing the identity of a human. This 100 person swarm cooperative search operation could have a variety
of local subtangle

16
6.14 Avionic Attitude Alignment
Let A = {a1 , ..., an } be a set of n swarm IoT devices which represent the identity of an avionic component
useable for an aerospace industry application (either aeronautical or astronautical if humans are involved, or
more generally for any autonomous system associated with aerial data which could even be fixed on a ground
station or could be a flying system such as a UAV, helicopter, airplane, or spacecraft). Then consensus on
the oracle data represented by the identities a1 , ..., an could lead to correct attitude alignment of the aircraft
that the avionic components represent, and this leads to a significant IoT application in the aerospace industry
wherein preventative health monitoring and IoT integration and assessment is ongoing and determinable with
the Qubic protocol what has been in agreement and what has not with various signals and sensors providing
alignment or not with the desired parameters determined by the flight programming controllers of the aircraft or
spacecraft. Avionic attitude alignment is an exemplemary usecase of qubic in applications where latency is not
paramount and there is a more stable system allowing for the communication to take at least a few milliseconds
to communicate (with current hardware limitations pre-Jinn) between ai and aj such that
Latency(A) = min{BERTD − BR∗i | 1 ≤ i ≤ n} > 
where  is the small amount of time which the latency needs to be greater than for this application to make
sense. Determining the epsilon parameter associated with avionic attitude alignment in a certain context would
be an interesting proof of concept application amongst a flock of UAVs that could demonstrate Qubic protocol
communications.

6.15 Orbit Maneuvers

Consensus between far away satellites, earth ground stations, and other constellations, potentially even with lu-
nar relay, can allow for orbit maneuvers to be requested, under pending approval while calculations on feasibility
and potentially human interaction, and accepted orbit maneuvers can be leveraged through smart contracts.
The effective smart contract result would be achieved through the participants in the orbit maneuver command
and control system as well their associated devices and identity representatives joining a Qubic committee
to then decide regarding potentially human initiated or machine initiated orbit maneuver requests which are
then partially human interaction determined and partially machine programmed determined to provide varying
oracle data results for the assembly which could cause certain qubic adjustment transactions to initiate new
orbit transfers or letting other committees associated with old orbits die by intentionally all having consensus
to not participate further in the old ones which would allow the local subtangle to just end by not having any
participants in the resource test associated with the qubic assembly/committee such that there next qubic pro-
cessing cycle never initiates for the old orbits. The new orbits are maintained by the chain of qubic adjustment
transactions which cause varying consensus lines to be the ones which are still retained for continual resource
testing and qubic processing in cycles that are associated with stability or successful transfer of orbit.

6.16 Space Recycling

Multi-agent consensus for multiple space vehicles in IoT networks for space recycling wherein the orbit maneuvers
described above can be used in space to recycle the limited amount of material in LEO (Low-Earth Orbit)
that may or may not be space junk. The problem of space junk as well as recycling of material in space
that can be harvested through even interplanetary dust harvesting technology (interstellar medium harvesting
techniques and apparatus inventions to adsorb sulfides, Mg silicates, FeNi metal, phosphides, carbonates, and
other chondritic interplanetary dust) can lead to the realism of additive manufacturing in space through space
recycling and interplanetary or interstellar medium material harvesting. The vaccuum is not empty and beyond
space mining of asteroids there are LEO space junk and dust harvesting possibilities for space recycling, all of
which can be coordinated with IoT networks of multiple space vehicles, or single space vehicles commandeered
by humans or autonomous space vehicles to have a multi-sensor system which for that sole vehicle implements
the Qubic protocol similarly to the virtual oracle case mentioned above for rendezvous and interception.

6.17 Sensor Network Controls for Robot Motion Planning

Sensor Network Controls can be controlled or executed through the Qubic protocol either trivially through a
virtualization of the oracle as described for both rendezvous and interception and space recycling.
Robot Motion Planning can be controlled or executed through the Qubic protocol by a network of devices or
control systems that are able to act as a local subtangle by mutual sharing of Qubic software updates and that
running an IRI node as the Abra code to be translated and run is an interesting case of having a virtual node
in the Qubic protocol beyond the actual case of robotic systems downloading their own IRI full node, the IRI
node can be virtually run with outsourced computation that supports the backbone of the node which may not
even be fully existing. This outsourced virtualization combo with Qubic allows for a very powerful architecture.

17
6.18 Programmable Matter and Claytronics
6.18.1 Self-reconfiguring modular robots
As a qubic application wherein we have a translator from ‘Meld‘ or ‘LDP‘ to Abra or have x86/FPGA imple-
mentation directly and feedback commands for abra processing if not a direct translator/compiler, wherein a
claytronics matrix or sets of such matrices provide programmable matter with smart contracts through Qubic
providing execution instructions for manufacturing, transportation, or generally any IT control system.

6.18.2 Meld
Meld is a declarative language, a logic programming language originally designed for programming overlay
networks. By using logic programming, the code for an ensemble of robots can be written from a global
perspective, enabling the programmer to concentrate on the overall performance of the claytronics matrix
rather than writing individual instructions for every one of the thousands to millions of catoms in the ensemble.
This dramatically simplifies the thought process for programming the movement of a claytronics matrix.“ ‘

6.18.3 Locally distributed predicates (LDP)

LDP is a reactive programming language. It has been used to trigger debugging in the earlier research. With
the addition of language that enables the programmer to build operations in the development of the shape of
the matrix, it can be used to analyze the distributed local conditions. It can operate on fixed-size, connected
groups of modules providing various functions of state configuration. A program that addresses a fixed-size
module rather than the entire ensemble allows programmers to operate the claytronic matrix more frequently
and efficiently. LDP further provides a means of matching distributed patterns. It enables the programmer to
address a larger set of variables with Boolean logic, which enables the program to search for larger patterns of
activity and behavior among groups of modules.

6.18.4 Distributed watchpoints

Using Meld and LDP we have a new claytronics application of Qubic for distributed watchpoints.
Performance errors for thousands to millions of individual catoms are hard to detect and debug, therefore,
claytronics matrix operations require a dynamic and self-directed process for identifying and debugging errors.
Claytronics researchers have developed Distributed Watchpoints, an algorithm-level approach to detecting and
fixing errors missed by more conventional debugging techniques. It establishes nodes that receive surveillance
to determine the validity of distributed conditions. This approach provides a simple and highly descriptive set
of rules to evaluate distributed conditions and proves effective in the detection of errors.

7 Conclusion
We have described the general architecture of Qubic with a focus on the high level mathematical details and
implementation focus as a brief introduction to provide further development upon. Our goal has been to
provide a terse guideline of what is to come so that the community can write functions in Abra and allow for
the continual co-creation with industry and the community of the IOTA protocol, IOTA extension interfaces,
Qubic, and projects on top of Qubic based on smart contracts on IOTA.
As a creator of assemblies, the provision of IOTA through rewards in an assembly is required and the
mechanism through doing so is not ensured, there is a risk taken on the participants in the assembly the first
time, and every time that they allocate resources to revealing results to the assembly. The rewards may never
come and further participation in an assembly from which rewards never came in the previous epoch would be
a strong disincentive to allow decay of the assemblies with faulty providers of rewards.
As a participant in an assembly, the decision regarding continual epochal progression is either incentivized
by the desire to participate or the abilities granted by using the Qubic protocol are sufficiently worth it to short
term and/or medium term and/or long term participate in that qubic assembly (committee) for a short and/or
medium and/or long term renewal process that can be partitioned to a varying gradient of choices dependent
upon the qubic adjustment transaction that has led the committee/assembly to veer into a certain direction
with renewing metadata parameters associated with the local subtangles which are deciding a consensus on
oracle data results.
NOTE: The oracles themselves are supposed to run the same computations to form a quorum/committee,
but the Qubic Computational Model (QCM) of Environment-Entity-Effect is likely comparable to PTA of PN’s
- the dataflow paths may likely take color from filters applied to specific tokens which can be written into the
effects, but due to an explanation regarding CPNs... insert something on CPNs

18
 Due to the Qubic Computation Model, the qubics can be created and run with conventional binary NAND
gates, which nonetheless allows for the implementation of trinary (non-binary emulated) qubics for improved
energy efficiency (approximately 50%) compared with binary computations. With IOTA as the backbone of
IoT and Qubic as the backbone of Aigarth, there could be the possibility soonTM (whenever CFB runs Aigarth)
for a global network of IoT devices which facilitates the existence of a quasi-Hypercomputational artificial
intelligence.

19