corda/docs/source/consensus.rst

Consensus Model
===============

The fundamental unit of consensus in Corda is the **state**. The concept of consensus can be divided into two parts:

1. Consensus over state **validity** -- parties can reach certainty that a transaction defining output states is accepted by the contracts pointed to by the states and has all the required signatures. This is achieved by parties independently running the same contract code and validation logic (as described in :doc:`data model <data-model>`)

2. Consensus over state **uniqueness** -- parties can reach certainty the the output states created in a transaction are the unique successors to the input states consumed by that transaction (in other words -- a state has not been used as an input by more than one transaction)

This article presents an initial model for addressing the **uniqueness** problem.

.. note:: The current model is still a **work in progress** and everything described in this article can and is likely to change

Notary
------

We introduce the concept of a **Notary**, which is an authority responsible for attesting that for a given transaction, it had not signed another transaction consuming any of its input states.
The data model is extended so that every **state** has an appointed Notary:

.. sourcecode:: kotlin

    interface ContractState {
        /** Contract by which the state belongs */
        val contract: Contract

        /** Identity of the notary that ensures this state is not used as an input to a transaction more than once */
        val notary: Party
    }

All transactions have to be signed by their input state Notary for the output states to be **valid** (apart from *issue* transactions, containing no input states).

.. note:: The Notary is a logical concept and can itself be a distributed entity, potentially a cluster maintained by mutually distrusting parties

When the Notary is requested to sign a transaction, it either signs over it, attesting that the outputs are the **unique** successors of the inputs,
or provides conflict information for any input state that had been consumed by another transaction it had signed before.
In doing so, the Notary provides the point of finality in the system. Until the Notary signature is obtained, parties cannot be sure that an equally valid, but conflicting transaction,
will not be regarded as confirmed. After the signature is obtained, the parties know that the inputs to this transaction have been uniquely consumed by this transaction.
Hence it is the point at which we can say finality has occurred.

Validation
----------

The Notary *does not validate* transaction integrity (i.e. does not run contracts or check signatures) to minimise the exposed data.
Validation would require the caller to reveal the whole transaction history chain, resulting in a privacy leak.

However, this makes it open to "denial of state" attacks, where a party could submit any invalid transaction to the Notary and thus "block" someone else's states.
That is partially alleviated by requiring the calling party to authenticate and storing its identity for the request.
The conflict information returned by the Notary specifies the consuming transaction id along with the identity of the party that had requested the commit.
If the conflicting transaction is valid, the current one gets aborted; if not – a dispute can be raised and the input states of the conflicting invalid transaction are "un-committed" (to be covered by legal process).

.. note:: At present the Notary can see the entire transaction, but we have a separate piece of work to replace the parts of the transaction it does not require knowing about with hashes (only input references, timestamp information, overall transaction ID and the necessary digests of the rest of the transaction to prove that the referenced inputs/timestamps really do form part of the stated transaction ID should be visible).

Multiple Notaries
-----------------

More than one Notary can exist in the network. This gives the following benefits:

* **Custom behaviour**. We can have both validating and privacy preserving Notaries -- parties can make a choice based on their specific requirements
* **Load balancing**. Spreading the transaction load over multiple Notaries will allow higher transaction throughput in the platform overall
* **Low latency**. Latency could be minimised by choosing a Notary physically closer the transacting parties

A transaction should only be signed by a Notary if all of its input states point to it.
In cases where a transaction involves states controlled by multiple Notaries, the states first have to be repointed to the same notary.
This is achieved by using a special type of transaction that doesn't modify anything but the Notary pointer of the state.
Ensuring that all input states point to the same Notary is the responsibility of each involved party
(it is another condition for an output state of the transaction to be **valid**)

Timestamping
------------

In this model the Notary also acts as a **Timestamping Authority**, verifying the transaction timestamp command.

For a timestamp to be meaningful, its implications must be binding on the party requesting it.
A party can obtain a timestamp signature in order to prove that some event happened before/on/or after a particular point in time.
However, if the party is not also compelled to commit to the associated transaction, it has a choice of whether or not to reveal this fact until some point in the future.
As a result, we need to ensure that the Notary either has to also sign the transaction within some time tolerance,
or perform timestamping *and* notarisation at the same time, which is the chosen behaviour for this model.

Implementation & Usage
----------------------

At present we have single basic implementation of a Notary that uses a :code:`UniquenessProvider` storing committed input states in memory:

.. sourcecode:: kotlin

    class InMemoryUniquenessProvider() : UniquenessProvider {
        /** For each input state store the consuming transaction information */
        private val committedStates = HashMap<StateRef, ConsumingTx>()

        override fun commit(tx: WireTransaction, callerIdentity: Party) {
            ...
        }
    }
    ...
    /**
     * Specifies the transaction id, the position of the consumed state in the inputs, and
     * the caller identity requesting the commit
     */
    data class ConsumingTx(val id: SecureHash, val inputIndex: Int, val requestingParty: Party)

To obtain a signature from a Notary use :code:`NotaryProtocol`, passing in a :code:`WireTransaction`.
The protocol will work out which Notary needs to be called based on the input states and the timestamp command.
For example, the following snippet can be used when writing a custom protocol:

.. sourcecode:: kotlin

    private fun getNotarySignature(wtx: WireTransaction): DigitalSignature.LegallyIdentifiable {
        return subProtocol(NotaryProtocol(wtx))
    }

On conflict the :code:`NotaryProtocol` with throw a :code:`NotaryException` containing the conflict details:

.. sourcecode:: kotlin

    /** Specifies the consuming transaction for the conflicting input state */
    data class Conflict(val stateHistory: Map<StateRef, ConsumingTx>)

Conflict handling and resolution is currently the responsibility of the protocol author.