Clarify Proof Selection Algorithm for Lambda's AlignedLayer Implementation

[MartinMinkov]

We need to gather detailed information about our proof selection algorithm to guide Lambda in their implementation for the AlignedLayer proving in the Mina-EVM bridge project.

Objective:
Provide Lambda with a clear understanding of how our proof selection algorithm works, particularly in the context of verifying the "best block" when checking N blocks (where N < k, the protocol constant).

Key Questions to Address:

1. How does our current proof selection algorithm verify the "best block" when checking N blocks?
2. Can the short fork rules be applied directly, or is a more nuanced approach required?
3. What are the implications and considerations of N being smaller than the protocol constant k?
4. Are there any specific edge cases or scenarios that Lambda should be aware of?
5. How does this algorithm interact with or impact the overall consensus mechanism in the bridge context?

[MartinMinkov]

As per discussion, this is not needed anymore due to a redesign.

[MartinMinkov]

Miscommunication, this is still needed and opening it up again.