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

feat: optimize byte trace generation #956

Merged
merged 3 commits into from
Jun 19, 2024
Merged

feat: optimize byte trace generation #956

merged 3 commits into from
Jun 19, 2024

Conversation

jtguibas
Copy link
Contributor

No description provided.

@jtguibas jtguibas changed the base branch from main to dev June 18, 2024 18:44
let mut event_map = HashMap::new();

/// This function returns a `trace` which is a matrix containing all possible byte operations.
pub fn trace(shard: u32) -> RowMajorMatrix<F> {
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

do we even need shard? if it's always 0? I'm kind of confused actually. Should this function even be a compile time constant?

edit: I see there's a comment below about making it constant

@jtguibas jtguibas merged commit 8e84cc8 into dev Jun 19, 2024
4 of 5 checks passed
@jtguibas jtguibas deleted the john/byte-lookup-events branch June 19, 2024 18:08
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

Successfully merging this pull request may close these issues.

None yet

2 participants