🚀Optimal Routing
Optimal Routing is a concept built on user intent and provided liquidity by Solvers.
For instance, a simple Solver algorithm may select the optimal DMM based on the user’s cross-chain intent according to the following rules:
Select all DMMs that can meet the user’s cross-chain amount requirements.
Sort the DMMs based on their cross0chain fees from low to high.
Select the DMM with the lowest fee and execute the operation through the platform.
Another example involving the splitting and routing of large cross-chain requests: In cases of large cross-chain requests where a single DMM may not have sufficient funds to handle the entire amount, the large request can be split into several smaller requests funded by multiple DMMs. The splitting rules can be formulated based on factors such as optimal rates, available funds of the DMMs, etc.
Splitting rules:
Select multiple DMMs that can handle a total of up to 20% of the cross-chain funds.
Sort the DMMs based on their cross-chain fees from low to high.
Aggregate funds from 5 DMMs to fulfill the user’s request.
In the case where it is not possible to find 5 DMMs that meet the above conditions, the user will be informed of the maximum amount that can currently be fulfilled.
Last updated