use dashmap::DashMap; use futures::future; use governor::clock::{Clock, QuantaClock, QuantaInstant}; use governor::middleware::NoOpMiddleware; use governor::state::{InMemoryState, NotKeyed}; use governor::{NotUntil, RateLimiter}; use std::num::NonZeroU32; use std::sync::Arc; use tokio::sync::RwLock; use tokio::time::sleep; use warp::Filter; type RateLimiterMap = DashMap; type ConnectionsMap = DashMap; type RpcRateLimiter = RateLimiter>; /// Load balance to the least-connection rpc struct BalancedRpcs { rpcs: RwLock>, connections: ConnectionsMap, ratelimits: RateLimiterMap, } impl BalancedRpcs { fn new(servers: Vec<(&str, u32)>, clock: &QuantaClock) -> BalancedRpcs { let mut rpcs: Vec = vec![]; let connections = DashMap::new(); let ratelimits = DashMap::new(); for (s, limit) in servers.into_iter() { rpcs.push(s.to_string()); connections.insert(s.to_string(), 0); if limit > 0 { let quota = governor::Quota::per_second(NonZeroU32::new(limit).unwrap()); let rate_limiter = governor::RateLimiter::direct_with_clock(quota, clock); ratelimits.insert(s.to_string(), rate_limiter); } } BalancedRpcs { rpcs: RwLock::new(rpcs), connections, ratelimits, } } async fn get_upstream_server(&self) -> Result> { let mut balanced_rpcs = self.rpcs.write().await; balanced_rpcs.sort_unstable_by(|a, b| { self.connections .get(a) .unwrap() .cmp(&self.connections.get(b).unwrap()) }); let mut earliest_not_until = None; for selected_rpc in balanced_rpcs.iter() { // check rate limits match self.ratelimits.get(selected_rpc).unwrap().check() { Ok(_) => { // rate limit succeeded } Err(not_until) => { // rate limit failed // save the smallest not_until. if nothing succeeds, return an Err with not_until in it if earliest_not_until.is_none() { earliest_not_until = Some(not_until); } else { let earliest_possible = earliest_not_until.as_ref().unwrap().earliest_possible(); let new_earliest_possible = not_until.earliest_possible(); if earliest_possible > new_earliest_possible { earliest_not_until = Some(not_until); } } continue; } }; // increment our connection counter let mut connections = self.connections.get_mut(selected_rpc).unwrap(); *connections += 1; // return the selected RPC return Ok(selected_rpc.clone()); } // return the smallest not_until if let Some(not_until) = earliest_not_until { return Err(not_until); } else { unimplemented!(); } } } /// Send to all the Rpcs /// Unlike BalancedRpcs, there is no tracking of connections /// We do still track rate limits struct LoudRpcs { rpcs: Vec, // TODO: what type? store with connections? ratelimits: RateLimiterMap, } impl LoudRpcs { fn new(servers: Vec<(&str, u32)>, clock: &QuantaClock) -> LoudRpcs { let mut rpcs: Vec = vec![]; let ratelimits = RateLimiterMap::new(); for (s, limit) in servers.into_iter() { rpcs.push(s.to_string()); if limit > 0 { let quota = governor::Quota::per_second(NonZeroU32::new(limit).unwrap()); let rate_limiter = governor::RateLimiter::direct_with_clock(quota, clock); ratelimits.insert(s.to_string(), rate_limiter); } } LoudRpcs { rpcs, ratelimits } } async fn get_upstream_servers(&self) -> Result, NotUntil> { let mut earliest_not_until = None; let mut selected_rpcs = vec![]; for selected_rpc in self.rpcs.iter() { // check rate limits match self.ratelimits.get(selected_rpc).unwrap().check() { Ok(_) => { // rate limit succeeded } Err(not_until) => { // rate limit failed // save the smallest not_until. if nothing succeeds, return an Err with not_until in it if earliest_not_until.is_none() { earliest_not_until = Some(not_until); } else { let earliest_possible = earliest_not_until.as_ref().unwrap().earliest_possible(); let new_earliest_possible = not_until.earliest_possible(); if earliest_possible > new_earliest_possible { earliest_not_until = Some(not_until); } } continue; } }; // return the selected RPC selected_rpcs.push(selected_rpc.clone()); } if selected_rpcs.len() > 0 { return Ok(selected_rpcs); } // return the earliest not_until if let Some(not_until) = earliest_not_until { return Err(not_until); } else { panic!("i don't think this should happen") } } fn as_bool(&self) -> bool { self.rpcs.len() > 0 } } struct Web3ProxyState { clock: QuantaClock, client: reqwest::Client, // TODO: LoudRpcs and BalancedRpcs should probably share a trait or something balanced_rpc_tiers: Vec, private_rpcs: LoudRpcs, } impl Web3ProxyState { fn new( balanced_rpc_tiers: Vec>, private_rpcs: Vec<(&str, u32)>, ) -> Web3ProxyState { let clock = QuantaClock::default(); // TODO: warn if no private relays Web3ProxyState { clock: clock.clone(), client: reqwest::Client::new(), balanced_rpc_tiers: balanced_rpc_tiers .into_iter() .map(|servers| BalancedRpcs::new(servers, &clock)) .collect(), private_rpcs: LoudRpcs::new(private_rpcs, &clock), } } /// send the request to the approriate RPCs async fn proxy_web3_rpc( self: Arc, json_body: serde_json::Value, ) -> anyhow::Result { let eth_send_raw_transaction = serde_json::Value::String("eth_sendRawTransaction".to_string()); if self.private_rpcs.as_bool() && json_body.get("method") == Some(ð_send_raw_transaction) { // there are private rpcs configured and the request is eth_sendSignedTransaction. send to all private rpcs loop { match self.private_rpcs.get_upstream_servers().await { Ok(upstream_servers) => { if let Ok(result) = self .try_send_requests(upstream_servers, None, &json_body) .await { return Ok(result); } } Err(not_until) => { // TODO: some sort of lock here? // TODO: there should probably be a lock on this so that other queries wait let deadline = not_until.wait_time_from(self.clock.now()); sleep(deadline).await; } }; } } else { // this is not a private transaction (or no private relays are configured) loop { let mut earliest_not_until = None; for balanced_rpcs in self.balanced_rpc_tiers.iter() { match balanced_rpcs.get_upstream_server().await { Ok(upstream_server) => { // TODO: capture any errors. at least log them if let Ok(result) = self .try_send_requests( vec![upstream_server], Some(&balanced_rpcs.connections), &json_body, ) .await { return Ok(result); } } Err(not_until) => { // save the smallest not_until. if nothing succeeds, return an Err with not_until in it if earliest_not_until.is_none() { earliest_not_until = Some(not_until); } else { // TODO: do we need to unwrap this far? can we just compare the not_untils let earliest_possible = earliest_not_until.as_ref().unwrap().earliest_possible(); let new_earliest_possible = not_until.earliest_possible(); if earliest_possible > new_earliest_possible { earliest_not_until = Some(not_until); } } } } } // TODO: some sort of lock here? // we haven't returned an Ok, sleep and try again // unwrap should be safe since we would have returned if it wasn't set let deadline = earliest_not_until.unwrap().wait_time_from(self.clock.now()); sleep(deadline).await; } } } async fn try_send_requests( &self, upstream_servers: Vec, connections: Option<&ConnectionsMap>, json_body: &serde_json::Value, ) -> anyhow::Result { // send the query to all the servers let bodies = future::join_all(upstream_servers.into_iter().map(|url| { let client = self.client.clone(); let json_body = json_body.clone(); tokio::spawn(async move { // TODO: there has to be a better way to do this map and map_err client .post(&url) .json(&json_body) .send() .await // add the url to the error so that we can decrement .map_err(|e| (url.clone(), e))? .text() .await // add the url to the result and the error so that we can decrement .map(|t| (url.clone(), t)) .map_err(|e| (url, e)) }) })) .await; // we are going to collect successes and failures let mut oks = vec![]; let mut errs = vec![]; // TODO: parallel? for b in bodies { match b { Ok(Ok((url, b))) => { // reduce connection counter if let Some(connections) = connections { *connections.get_mut(&url).unwrap() -= 1; } // TODO: if "no block with that header", skip this response (maybe retry) oks.push(b); } Ok(Err((url, e))) => { // reduce connection counter if let Some(connections) = connections { *connections.get_mut(&url).unwrap() -= 1; } // TODO: better errors eprintln!("Got a reqwest::Error: {}", e); errs.push(anyhow::anyhow!("Got a reqwest::Error")); } Err(e) => { // TODO: better errors eprintln!("Got a tokio::JoinError: {}", e); errs.push(anyhow::anyhow!("Got a tokio::JoinError")); } } } // TODO: which response should we use? if oks.len() > 0 { return Ok(oks.pop().unwrap()); } else if errs.len() > 0 { return Err(errs.pop().unwrap()); } else { return Err(anyhow::anyhow!("no successful responses")); } } } #[tokio::main] async fn main() { // TODO: load the config from yaml instead of hard coding // TODO: support multiple chains in one process. then we could just point "chain.stytt.com" at this and caddy wouldn't need anything else // TODO: i kind of want to make use of caddy's load balancing and health checking and such though let listen_port = 8445; // TODO: be smart about about using archive nodes? let state = Web3ProxyState::new( vec![ // local nodes vec![("https://10.11.12.16:8545", 0)], // paid nodes // TODO: add paid nodes (with rate limits) // free nodes // TODO: add rate limits vec![ ("https://main-rpc.linkpool.io", 0), ("https://rpc.ankr.com/eth", 0), ], ], vec![ ("https://api.edennetwork.io/v1/beta", 0), ("https://api.edennetwork.io/v1/", 0), ], ); let state: Arc = Arc::new(state); let proxy_rpc_filter = warp::any() .and(warp::post()) .and(warp::body::json()) .then(move |json_body| state.clone().proxy_web3_rpc(json_body)) .map(handle_anyhow_errors); println!("Listening on 0.0.0.0:{}", listen_port); warp::serve(proxy_rpc_filter) .run(([0, 0, 0, 0], listen_port)) .await; } /// convert result into an http response. use this at the end of your warp filter pub fn handle_anyhow_errors(res: anyhow::Result) -> Box { match res { Ok(r) => Box::new(r.into_response()), // TODO: json error? Err(e) => Box::new(warp::reply::with_status( format!("{}", e), reqwest::StatusCode::INTERNAL_SERVER_ERROR, )), } }