Skip to content

[Merged by Bors] - feat: prove an upper bound on bitwise operations#8598

Closed
alexkeizer wants to merge 3 commits intomasterfrom
nat-bitwise-lt
Closed

[Merged by Bors] - feat: prove an upper bound on bitwise operations#8598
alexkeizer wants to merge 3 commits intomasterfrom
nat-bitwise-lt

Conversation

@alexkeizer
Copy link
Copy Markdown
Collaborator

@alexkeizer alexkeizer commented Nov 23, 2023

A simple result which shows that if x and y fit within n bits, then the result of any bitwise operation on x and y also
fits within n bits.

Co-authored-by: mhk119 58151072+mhk119@users.noreply.github.com
Co-authored-by: Eric Wieser wieser.eric@gmail.com


Factored out from #5920

Open in Gitpod

Copy link
Copy Markdown
Member

@eric-wieser eric-wieser left a comment

Choose a reason for hiding this comment

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

maintainer merge
(since I wrote one of these proofs)

@github-actions
Copy link
Copy Markdown

🚀 Pull request has been placed on the maintainer queue by eric-wieser.

1 similar comment
@github-actions
Copy link
Copy Markdown

🚀 Pull request has been placed on the maintainer queue by eric-wieser.

Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
@kmill
Copy link
Copy Markdown
Contributor

kmill commented Nov 25, 2023

Thanks!

bors r+

@github-actions github-actions bot added ready-to-merge This PR has been sent to bors. and removed awaiting-review labels Nov 25, 2023
mathlib-bors bot pushed a commit that referenced this pull request Nov 25, 2023
A simple result which shows that if `x` and `y` fit within `n` bits, then the result of any bitwise operation on `x` and `y` also
fits within `n` bits.

Co-authored-by: mhk119 [58151072+mhk119@users.noreply.github.com](mailto:58151072+mhk119@users.noreply.github.com)
Co-authored-by: Eric Wieser [wieser.eric@gmail.com](mailto:wieser.eric@gmail.com)
@mathlib-bors
Copy link
Copy Markdown
Contributor

mathlib-bors bot commented Nov 25, 2023

Pull request successfully merged into master.

Build succeeded:

@mathlib-bors mathlib-bors bot changed the title feat: prove an upper bound on bitwise operations [Merged by Bors] - feat: prove an upper bound on bitwise operations Nov 25, 2023
@mathlib-bors mathlib-bors bot closed this Nov 25, 2023
@mathlib-bors mathlib-bors bot deleted the nat-bitwise-lt branch November 25, 2023 17:55
awueth pushed a commit that referenced this pull request Dec 19, 2023
A simple result which shows that if `x` and `y` fit within `n` bits, then the result of any bitwise operation on `x` and `y` also
fits within `n` bits.

Co-authored-by: mhk119 [58151072+mhk119@users.noreply.github.com](mailto:58151072+mhk119@users.noreply.github.com)
Co-authored-by: Eric Wieser [wieser.eric@gmail.com](mailto:wieser.eric@gmail.com)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

ready-to-merge This PR has been sent to bors.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants