Skip to content

Speed up and reduce the memory of Groebner bases over QQ #383

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.

Sign up for GitHub

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

Merged
ederc merged 4 commits into from
Oct 25, 2026
+570 −217
Merged

Speed up and reduce the memory of Groebner bases over QQ #383

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
9364154
Reduce memory used by multi-modular Groebner bases over QQ
claude Sep 30, 2026
7167200
Fix per-prime leaks in F4 and avoid touching unused hash table memory
claude Sep 30, 2026
e26b8bb
Speed up the lifting of Groebner bases over QQ
mohabsafey Oct 24, 2026
76c931c
Choose rational reconstruction bounds from the guessed denominator
mohabsafey Oct 25, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion src/msolve/duplicate.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -72,7 +72,9 @@ static inline void duplicate_tracer(
memcpy(btrace[i]->lm, btrace[0]->lm,
(unsigned long)btrace[0]->lml * sizeof(sdm_t));

/* array of trace data per F4 round */
/* array of trace data per F4 round
* (replaces the one allocated by initialize_trace) */
free(btrace[i]->td);
btrace[i]->td = calloc((unsigned long)btrace[0]->ltd, sizeof(td_t));

for(len_t l = 0; l < btrace[0]->ltd; ++l){
Expand Down
Loading
Loading