feat: add method for finding oldest state and computing state

[frrist]

What

This PR adds 4 new commands to the chain command.

find oldest

Finds the range of states lily has a complete state tree for:

$ lily chain find-oldest
Newest:
	StateRoot:	1830000
	Messages:	1830000
Oldest:
	StateRoot:	1828199
	Messages:	1828199

list states

Lists all states lily has and their completeness:

$ lily chain list-state --limit=1829989
+---------+-----------+----------+
|  HEIGHT | STATETREE | MESSAGES |
+---------+-----------+----------+
| 1830000 | true      | true     |
+---------+-----------+----------+
| 1829999 | true      | true     |
+---------+-----------+----------+
| 1829998 | true      | true     |
+---------+-----------+----------+
| 1829997 | true      | true     |
+---------+-----------+----------+
| 1829996 | true      | true     |
+---------+-----------+----------+
| 1829995 | true      | true     |
+---------+-----------+----------+
| 1829994 | true      | true     |
+---------+-----------+----------+
| 1829993 | true      | true     |
+---------+-----------+----------+
| 1829992 | true      | true     |
+---------+-----------+----------+
| 1829991 | true      | true     |
+---------+-----------+----------+
| 1829990 | true      | true     |
+---------+-----------+----------+
| 1829989 | true      | true     |
+---------+-----------+----------+

compute

compute the state of a tipset specified by epoch:

$ lily chain compute --epoch=1829776

compute range

computes a range of tipsets specified by epochs:

$ lily chain compute-range --to=1829981 --from=1829777

[codecov-commenter]

Codecov Report

Merging #1038 (c149d21) into master (2dac569) will not change coverage.
The diff coverage is n/a.

@@          Coverage Diff           @@
##           master   #1038   +/-   ##
======================================
  Coverage    34.4%   34.4%           
======================================
  Files          44      44           
  Lines        2925    2925           
======================================
  Hits         1008    1008           
  Misses       1821    1821           
  Partials       96      96           

[frrist]

So this is probably wrong due to null rounds

[placer14]

Would it be sufficient to allow for some N number of null rounds before breaking? A value which skips null rounds and increments M until it's more than N and then break? Is there another way you would approach this?

[kasteph]

looks good! if i could give feedback, would it be possible to have a json output option of find-oldest? prob not in scope of this pr.

[placer14]

@kasteph this PR exports the output in JSON:

ubuntu@ip-172-31-20-4:~/lily$ ./lily chain state-inspect --limit 1 --verbose | jq
2022-08-25T02:25:53.280Z        WARN    cliutil util/apiinfo.go:81      API Token not set and requested, capabilities might be limited.
{
  "summary": {
    "messages": {
      "newest": 1962369,
      "oldest": 1962369
    },
    "stateroots": {
      "newest": 1962369,
      "oldest": 1962369
    }
  },
  "details": {
    "1962369": {
      "messages": true,
      "receipts": true,
      "stateroot": true
    }
  }
}

(If you want to find oldest state, run with --limit 10000000000 and it should return the oldest state in the JSON summary.)

[kasteph]

@placer14 thanks! I probably missed the --verbose flag (or based on the timeline accdg to GitHub, it was added after my review 😅 ).