Port over best tip selection algorithm to TypeScript

[MartinMinkov]

To have a good way of selecting the best tip among multiple blocks at the tip of the network, we need to implement a selection algorithm. We can port over the current algorithm here in TypeScript to do so: https://github.com/MinaProtocol/mina/blob/bff1e117ae4740fa51d12b32736c6c63d7909bd1/src/lib/consensus/proof_of_stake.ml#L2950

[nicc]

Indirectly Irresponsible Individual: @bkase

[MartinMinkov]

This cannot be implemented now as last_vrf_output and sub_window_densities are missing from the Archive Node schema. This will have to wait until changes to the Archive Node schema are made.

[MartinMinkov]

Changes to incorporate the data is located here: MinaProtocol/mina#12750

[MartinMinkov]

With the new Berkeley redeployment, this is now actionable and ready to implement 🥳

[shimkiv]

@MartinMinkov should this one fix an issue when Archive-Node-API returned duplicated data for the short period of time because of the chain reorg?
Example, create zkapp txn with events/actions in env. where forks are more frequent (light network), then wait until it will be added into the block and query Archive-Node-API for events/actions. In case when forks are more frequent API will return duplicated data within the time period required to settle the best tip within the network, after which API will return data without duplicates.

[MartinMinkov]

Yeah, it will fix the duplicate data at the best-tip issue. Currently, the archive node API will return all blocks that are proposed for the best-tip but this change will change the best-tip resolver to choose the "best" block to return for the GraphQL request. Duplicate data should not be happening for blocks below the max block height, however.