-
Notifications
You must be signed in to change notification settings - Fork 390
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: add lookup table #388
base: master
Are you sure you want to change the base?
Conversation
e83f05b
to
6da29b2
Compare
FYI @Tabaie, I updated the PR description about possible improvements. |
Does this implement a particular paper? |
The AS Waksman routing network is described in On Arbitrary Waksman Networks and their Vulnerability by Beauquier and Darrot. It describes how to connect the gates in layers, the tricks for the lower gates and splitting to obtain the arbitrary-sizeness (compared to previous results where the number of inputs had to be power of two). It also describes bipartite coloring for deciding the routing. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Apologies for the long delay!
Adds AS-Waksman permutation network (for internal use only for building gadgets).
We implement a simple append-only lookup table using it. We could probably also to a full RW memory possibly.
Thoughts:
Actually, all these things seem to be something which could be provided as initialisation options. Maybe makes sense to implement that way?