-
-
Notifications
You must be signed in to change notification settings - Fork 34
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
Improve estimated matching with COCM update #4519
Comments
Hey @CarlosQ96 let's sync on this one when you're back - I'd love to help you understand the COCM algorithm and help you evaluate what it would take to use it for estimated matching improvements |
@CarlosQ96 as discussed in the QF call today, we were talking about... instead of trying to pull apart the COCM algo and rebuild it... what if we just hosted the python script somewhere, and then send out data to it, periodically throughout the round to determine the estimated matching? If you could try to figure out someway to do that, it would be amazing! And also determine like... how often it would be feasible/logical for us to update the estiamted matching. If it is, for example, once per hour, then we may want to add an extra component to the frontend to show the last update and next update times. This is not absolutely critical to build & have on prod before our sept 3 round, but it is a nice-to-have, so see what's possible :) |
Hey @CarlosQ96 can you link what you did in here? |
Working on the python api to process the donation data with the script |
still in progress @CarlosQ96 needs to push a PR this week. |
We are using COCM to calculate the matching funds for rounds now in QF, so we should build a new way to calculate the estimated matching using that algorithm.
The COCM algo is here: https://github.com/Giveth/COCM_QF_Algorithm
In order to not bogg down our backend, I am curious to know what it would take to use this algorithm to calculate the matching funds... but we could run the code for example one per hour, or once per half hour.
@CarlosQ96 can you investiagte and report back what you think?
if you have any questions about the algo, @koday1 could offer some insights.
The text was updated successfully, but these errors were encountered: