Skip to content
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

Consider triple pairs for storage instead of singular ones #260

Open
ChaoticTempest opened this issue Feb 28, 2025 · 0 comments
Open

Consider triple pairs for storage instead of singular ones #260

ChaoticTempest opened this issue Feb 28, 2025 · 0 comments

Comments

@ChaoticTempest
Copy link
Contributor

Currently we pop entirely separate triples and check their intersection. This can lead to a series of popping and pushing back into redis storage if the intersection of participants does not meet the requirements. How about before storing them, we create pairings of them such that this intersection at least meets the threshold requirements.

But note this basically frontloads this subset logic. To circumvent this even further, we should generate at least pairs of triples at the same time with the same participant set. Also, cait-sith allows us to do batch triple generation with the same participant set allowing us to group these triples without our complex logic of intersections.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant