feat: implement 0x1C - SHR opcode

[jobez]

---

fork: Constantinople
group: Comparison & Bitwise Logic Operations

Index 1 is top of the stack. See PUSH.

Notes

Shift the bits towards the least significant one. The bits moved before the first one are discarded, the new bits are set to 0.

Stack input

0. shift: number of bits to shift to the right.
1. value: 32 bytes to shift.

Stack output

0. value >> shift: the shifted value. If shift is bigger than 255, returns 0.

Examples

*	Input	Output	*	*	Input	Output
1	1	1	*	1	4	0xF
2	2		*	2	0xFF

Reproduce in playground.

Error cases

The state changes done by the current context are reverted in those cases:

• Not enough values on the stack.

[github-actions]

There hasn't been any activity on this issue recently, and in order to prioritize active issues, it will be marked as stale.
Please make sure to update to the latest version and check if that solves the issue. Let us know if that works for you by leaving a 👍
Because this issue is marked as stale, it will be closed and locked in 7 days if no further activity occurs.
Thank you for your contributions!

[khaeljy]

@Eikix Can I implement this?