dex-services
dex-services copied to clipboard
gnosis
Off-chain services for the Gnosis Protocol v1.
The solver needs price estimates. Historically we have been using external sources to provide these like kraken, dexag, 1inch. In #842 we implemented the pricegraph as a source of price...
https://github.com/gnosis/dex-services/issues/970#issuecomment-651025369 @marcovc > If the solver was given price estimates for all tokens as an input, then it wouldn't need to do any more fancy computations. This should be guaranteed...
Currently the nonce error detection [here](https://github.com/gnosis/dex-services/blob/84b16e9ba44590c4aec77c9edfa227697bea882f/core/src/solution_submission.rs#L284-L299) is very specific to OpenEthereum nodes, we should verify that it also works on other nodes. Note that for now this is not a...
I think ultimately we might even want to share this state across run-loops so that the next batch uses the current batch's nonce +1 even if the cancellation tx is...
This will help catch issues such as #1176
There are still two url parameters from the nodejs price estimator that we haven't implemented: atoms=true and hops= `hops` doesn't apply to the pricegraph so I think we should remove...
It's a shame that we blatantly copy this deploy script across repos but now even inside the same repo. I think there should be a way to share this logic...
https://github.com/gnosis/dex-services/pull/864 changes ci to use the standard solver instead of the naive solver. Should we remove the naive solver from the code base? https://github.com/gnosis/dex-services/pull/864#pullrequestreview-410906827 > When I incorporated the open...
Evaluate [SPFA](https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm) algorithm for finding shortest paths in the graph. It is supposed to have linear average case performance which can be super beneficial as the orderbook grows.
Since people have been asking for it and we need content for our developer portal, we should write a step by step instruction on how one can run and also...
