chore: upgrade tonic 0.9 → 0.10, prost 0.11 → 0.12, force BTreeMap on proto maps

src/chain_parsers/visualsign-ethereum/src/abi_metadata.rs

@@ -372,7 +372,7 @@ mod tests {
 
     const TEST_ADDRESS: &str = "0xdAC17F958D2ee523a2206206994597C13D831ec7";
 
-    fn make_abi_mappings(entries: Vec<(&str, Abi)>) -> std::collections::HashMap<String, Abi> {
+    fn make_abi_mappings(entries: Vec<(&str, Abi)>) -> std::collections::BTreeMap<String, Abi> {
         entries
             .into_iter()
             .map(|(addr, abi)| (addr.to_string(), abi))

src/chain_parsers/visualsign-ethereum/src/abi_registry.rs

@@ -8,7 +8,7 @@
 //! - Performance: No file I/O or JSON parsing overhead
 //! - Determinism: Same binary always uses same ABIs
 
-use std::collections::HashMap;
+use std::collections::BTreeMap;
 use std::sync::Arc;
 
 use alloy_json_abi::JsonAbi;
@@ -35,17 +35,17 @@ pub type ChainId = u64;
 #[derive(Clone)]
 pub struct AbiRegistry {
     /// Maps ABI name -> parsed JsonAbi
-    abis: Arc<HashMap<String, Arc<JsonAbi>>>,
+    abis: Arc<BTreeMap<String, Arc<JsonAbi>>>,
     /// Maps (chain_id, contract_address) -> ABI name
-    address_mappings: Arc<HashMap<(ChainId, Address), String>>,
+    address_mappings: Arc<BTreeMap<(ChainId, Address), String>>,
 }
 
 impl AbiRegistry {
     /// Creates a new empty ABI registry
     pub fn new() -> Self {
         Self {
-            abis: Arc::new(HashMap::new()),
-            address_mappings: Arc::new(HashMap::new()),
+            abis: Arc::new(BTreeMap::new()),
+            address_mappings: Arc::new(BTreeMap::new()),
         }
     }
 

src/chain_parsers/visualsign-ethereum/src/networks.rs

@@ -497,17 +497,17 @@ mod tests {
 
     #[test]
     fn test_constants_are_unique() {
-        let mut seen_ids = std::collections::HashSet::new();
+        let mut seen_ids = std::collections::BTreeSet::new();
         for &(chain_id, _, _, _) in ALL_NETWORKS {
             assert!(seen_ids.insert(chain_id));
         }
 
-        let mut seen_names = std::collections::HashSet::new();
+        let mut seen_names = std::collections::BTreeSet::new();
         for &(_, network_id, _, _) in ALL_NETWORKS {
             assert!(seen_names.insert(network_id));
         }
 
-        let mut seen_displays = std::collections::HashSet::new();
+        let mut seen_displays = std::collections::BTreeSet::new();
         for &(_, _, display, _) in ALL_NETWORKS {
             assert!(seen_displays.insert(display));
         }