-
Notifications
You must be signed in to change notification settings - Fork 312
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
funding: stub LQT actions #5014
Comments
2 tasks
cronokirby
added a commit
that referenced
this issue
Jan 30, 2025
## Describe your changes Closes #5014. This implements the action for LQT voting, up to (and including) stateless checks. This is similar to delegator voting, but with some light simplification. This also reuses the strategy of UndelegateClaim in using an inner proof shared with a different circuit, which is, imo, cleaner code since the fact that the delegator vote circuit can be reused is a happy coincidence. Testing deferred. ## Checklist before requesting a review - [x] I have added guiding text to explain how a reviewer should test these changes. - [x] If this code contains consensus-breaking changes, I have added the "consensus-breaking" label. Otherwise, I declare my belief that there are not consensus-breaking changes, for the following reason: > you betcha --------- Signed-off-by: Lúcás Meier <[email protected]> Co-authored-by: Erwan Or <[email protected]>
conorsch
pushed a commit
that referenced
this issue
Jan 31, 2025
## Describe your changes Closes #5014. This implements the action for LQT voting, up to (and including) stateless checks. This is similar to delegator voting, but with some light simplification. This also reuses the strategy of UndelegateClaim in using an inner proof shared with a different circuit, which is, imo, cleaner code since the fact that the delegator vote circuit can be reused is a happy coincidence. Testing deferred. ## Checklist before requesting a review - [x] I have added guiding text to explain how a reviewer should test these changes. - [x] If this code contains consensus-breaking changes, I have added the "consensus-breaking" label. Otherwise, I declare my belief that there are not consensus-breaking changes, for the following reason: > you betcha --------- Signed-off-by: Lúcás Meier <[email protected]> Co-authored-by: Erwan Or <[email protected]>
conorsch
pushed a commit
that referenced
this issue
Feb 4, 2025
## Describe your changes Closes #5014. This implements the action for LQT voting, up to (and including) stateless checks. This is similar to delegator voting, but with some light simplification. This also reuses the strategy of UndelegateClaim in using an inner proof shared with a different circuit, which is, imo, cleaner code since the fact that the delegator vote circuit can be reused is a happy coincidence. Testing deferred. ## Checklist before requesting a review - [x] I have added guiding text to explain how a reviewer should test these changes. - [x] If this code contains consensus-breaking changes, I have added the "consensus-breaking" label. Otherwise, I declare my belief that there are not consensus-breaking changes, for the following reason: > you betcha --------- Signed-off-by: Lúcás Meier <[email protected]> Co-authored-by: Erwan Or <[email protected]>
conorsch
pushed a commit
that referenced
this issue
Feb 5, 2025
## Describe your changes Closes #5014. This implements the action for LQT voting, up to (and including) stateless checks. This is similar to delegator voting, but with some light simplification. This also reuses the strategy of UndelegateClaim in using an inner proof shared with a different circuit, which is, imo, cleaner code since the fact that the delegator vote circuit can be reused is a happy coincidence. Testing deferred. ## Checklist before requesting a review - [x] I have added guiding text to explain how a reviewer should test these changes. - [x] If this code contains consensus-breaking changes, I have added the "consensus-breaking" label. Otherwise, I declare my belief that there are not consensus-breaking changes, for the following reason: > you betcha --------- Signed-off-by: Lúcás Meier <[email protected]> Co-authored-by: Erwan Or <[email protected]>
conorsch
pushed a commit
that referenced
this issue
Feb 5, 2025
## Describe your changes Closes #5014. This implements the action for LQT voting, up to (and including) stateless checks. This is similar to delegator voting, but with some light simplification. This also reuses the strategy of UndelegateClaim in using an inner proof shared with a different circuit, which is, imo, cleaner code since the fact that the delegator vote circuit can be reused is a happy coincidence. Testing deferred. ## Checklist before requesting a review - [x] I have added guiding text to explain how a reviewer should test these changes. - [x] If this code contains consensus-breaking changes, I have added the "consensus-breaking" label. Otherwise, I declare my belief that there are not consensus-breaking changes, for the following reason: > you betcha --------- Signed-off-by: Lúcás Meier <[email protected]> Co-authored-by: Erwan Or <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
To implement delegator voting, we can reuse the circuit used for delegator voting in the governance component. This works because we want to show that:
start_position
of the tournamentStateless validation
incentivized_asset_denom
starts withtransfer/
incentivized_asset_denom
is less than 256 charactersproposal
is0
Vote
isUNSPECIFIED
We can leave the stateful validation and pre-execution checks out for now.
The text was updated successfully, but these errors were encountered: