Minor formatting and typo fixes

core/src/main/kotlin/com/r3corda/core/crypto/Party.kt

@@ -4,9 +4,6 @@ import com.r3corda.core.contracts.PartyAndReference
 import com.r3corda.core.serialization.OpaqueBytes
 import java.security.PublicKey
 
-/**
- * Created by matth on 14/05/2016.
- */
 /** A [Party] is well known (name, pubkey) pair. In a real system this would probably be an X.509 certificate. */
 data class Party(val name: String, val owningKey: PublicKey) {
     override fun toString() = name

core/src/main/kotlin/com/r3corda/core/testing/TestUtils.kt

@@ -262,8 +262,7 @@ class TransactionGroupDSL<T : ContractState>(private val stateType: Class<T>) {
     }
 
     val String.output: TransactionState<T>
-        get() =
-        labelToOutputs[this] ?: throw IllegalArgumentException("State with label '$this' was not found")
+        get() = labelToOutputs[this] ?: throw IllegalArgumentException("State with label '$this' was not found")
     val String.outputRef: StateRef get() = labelToRefs[this] ?: throw IllegalArgumentException("Unknown label \"$this\"")
 
     fun <C : ContractState> lookup(label: String): StateAndRef<C> {

docs/source/consensus.rst

@@ -5,7 +5,7 @@ The fundamental unit of consensus in Corda is the **state**. The concept of cons
 
 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)
+2. Consensus over state **uniqueness** -- parties can reach certainty 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.