Initial consensus rules

specs/consensus.md

@@ -16,9 +16,9 @@ Consensus Rules
     - [`block.lastCommit`](#blocklastcommit)
     - [`block.availableData`](#blockavailabledata)
   - [State Transitions](#state-transitions)
+    - [`block.availableData.evidenceData`](#blockavailabledataevidencedata)
+    - [`block.availableData.transactionData`](#blockavailabledatatransactiondata)
     - [Validators and Delegations](#validators-and-delegations)
-  - [Formatting](#formatting)
-  - [Availability](#availability)
 
 ## System Parameters
 
@@ -48,7 +48,6 @@ Consensus Rules
 | `UNBONDING_DURATION`                 | `uint32` |         | `block` | Duration, in blocks, for unbonding a validator or delegation.                                                                                                       |
 | `VERSION`                            | `uint64` | `1`     |         | Version of the LazyLedger chain. Breaking changes (hard forks) must update this parameter.                                                                          |
 
-
 ### Reserved Namespace IDs
 
 | name                                   | type          | value                | description                                                                   |
@@ -67,7 +66,6 @@ Consensus Rules
 | `ACTIVE_VALIDATORS_SUBTREE_ID`   | `StateSubtreeID` | `0x02` |
 | `INACTIVE_VALIDATORS_SUBTREE_ID` | `StateSubtreeID` | `0x03` |
 
-
 ### Rewards and Penalties
 
 | name                 | type     | value | unit | description                      |
@@ -77,8 +75,12 @@ Consensus Rules
 
 ## Leader Selection
 
+TODO
+
 ## Fork Choice
 
+TODO
+
 ## Block Validity
 
 This section specifies the entirety of the validity rules for a newly-seen block, `block`.
@@ -140,10 +142,19 @@ TODO define fraud proof for invalid block here
 
 Once parsed, the following checks must be `true`:
 
-1. The commitments of the [erasure-coded extended](./data_structures.md#2d-reed-solomon-encoding-scheme) `availableData` must match those in `header.availableDataHeader`.
+1. The commitments of the [erasure-coded extended](./data_structures.md#2d-reed-solomon-encoding-scheme) `availableData` must match those in `header.availableDataHeader`. Implicitly, this means that both rows and columns must be ordered lexicographically by namespace ID since they are committed to in a [Namespace Merkle Tree](data_structures.md#namespace-merkle-tree).
+1. Length of `availableData.intermediateStateRootData` == length of `availableData.transactionData` + length of `availableData.evidenceData`.
 
 ### State Transitions
 
+#### `block.availableData.evidenceData`
+
+
+
+#### `block.availableData.transactionData`
+
+
+
 #### Validators and Delegations
 
 A transaction `tx` that requests a new validator initializes a new [Validator](data_structures.md#validator) leaf in the inactive validators subtree for that account as follows:
@@ -216,9 +227,3 @@ then updates the target validator's voting power:
 validator.delegatedCount -= 1
 validator.votingPower -= delegation.votingPower
 ```
-
-### Formatting
-
-Leaves in the message [Namespace Merkle Tree](data_structures.md#namespace-merkle-tree) must be ordered lexicographically by namespace ID.
-
-### Availability

specs/figures/block_data_structures.dot

@@ -22,12 +22,12 @@ digraph G {
 
         subgraph cluster_header {
             label = "header";
-            struct1 [label = "height | timestamp | lastBlockID | <f3> lastCommitHash | consensusRoot | stateCommitment | availableDataOriginalSharesUsed | <f6> availableDataRoot | proposerAddress"];
+            struct1 [label = "height | timestamp | lastBlockID | <f3> lastCommitHash | consensusRoot | stateCommitment | availableDataOriginalSharesUsed | <f7> availableDataRoot | proposerAddress"];
         }
     }
 
     struct1:f3 -> struct2;
-    struct1:f6 -> struct4 [label = "Merkle root of"];
+    struct1:f7 -> struct4 [label = "Merkle root of"];
     struct4:f0 -> struct3 [label = "NMT roots to\nerasure-coded data"];
 
     edge [style = invis];