LQT: reimplementation with minimal in-memory state (#5049)

## Describe your changes

This leans much more heavily on the database for indexing and ranking,
such that the only bit of in-memory storage is just the number of assets
that can be considered at most, based on the threshold.

Downside is that more of the logic exists as the sum of the behavior
across state keys,
and some tests were removed.

Adding some tests at the component level here which read and write
against temp storage would be useful ; perhaps mocking the
implementation of reward distribution or something.

## Checklist before requesting a review

- [x] I have added guiding text to explain how a reviewer should test
these changes.

- [x] If this code contains consensus-breaking changes, I have added the
"consensus-breaking" label. Otherwise, I declare my belief that there
are not consensus-breaking changes, for the following reason:

crates/core/component/funding/src/action_handler/liquidity_tournament/mod.rs

@@ -144,7 +144,7 @@ impl ActionHandler for ActionLiquidityTournamentVote {
                 power,
                 &self.body.rewards_recipient,
             )
-            .await?;
+            .await;
         Ok(())
     }
 }