Ant colony on bpp9000

[cyber-pc]

Ant-colony tree mining on bpp9000

Adds ant-colony tree mining on top of the existing bpp9000 scorer. A miner extends a per-identity tree instead of searching from scratch: a child inherits a parent solution, mutates it, and is accepted only if it beats its parent and clears the epoch threshold.

• Adapt score_bpp9000 for the colony: split initializeANN into deriveRootLut / deriveMutationSeeds, extract the walk (computeScoreFromCurrent), and add deriveRootANN + computeScoreFromParent (a child inherits the parent LUT and walks it under its nonce).
• Score worker: generalize the score queue to a generic task base, pre-score ant solutions on arrival, add a seen filter and a retries queue.
• Ant Tree + rules: per-identity tree with validateChild gates (beat-parent, threshold, freshness, canonical nonce, per-parent child cap, replay, capacity and tick anchor freshness
• New AntColonyMiningSolutionTransaction (inputType 12) + MESSAGE_TYPE_ANT_SOLUTION broadcast and publish on-chain.
• Extract the miner-ranking update; collect the best ANN per identity at epoch end (harvest top NUMBER_OF_COMPUTORS).
• Add request and respond with operator-signed identity-tree + parent-ANN reads; public epoch-context read.
• Save load support for the ant colony.
• Docs: doc/ant_colony_mining.md

[cyber-pc]

This PR is tested and ready.