-
Notifications
You must be signed in to change notification settings - Fork 75
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Heuristically filter orders for batch cutting #740
Comments
Eventually we also have to think about prioritizing for which limit order we want to update the |
Just to clarify, is this issue about solving (i.e. ordering of orders we chose to look at in our |
It's about batch cutting. |
I am not sure I agree with this, although I definitely see where it's coming from. To me, this will look like order censorship; having a valid order in the orderbook that no solver potentially ever sees. |
Solvers won't see orders only if their prices are far outside the market range. We can't spam solvers with all limit orders, that's not going to work. But it's definitely not censorship. Censorship would be if we omit limit orders even if they are within the market price, which we don't do. |
While, I must admit I'm not super happy with filtering out limit orders, one of the major risks from this feature is the additional load on the services and not being able to keep up with auction creation. This changes is more about providing us with safety handles and to reduce that risk. Another proposal by @MartinquaXD was to take N most favourably priced orders (#765). Maybe we can iterate on how we do this filtering and improve our algorithm and heuristics over time, but having an "easy way out" of having an orderbook that is just too large is an important backup IMO.
I agree, but I think the alternative is worse (in having an order that a solver doesn't see because we can't compute fees fast enough). |
During batch cutting, only include orders which are a certain % away (configurable) from the estimated native price.
The text was updated successfully, but these errors were encountered: