02:44:38 <m-relay> <w​egav:matrix.org> Hello everone, is there any new algorithm released following Randomx on monero?
02:44:39 <m-relay> <w​egav:matrix.org> I saw Full-Chain Membership Proofs Development
03:02:01 <m-relay> <w​egav:matrix.org> Can anyone predict when this research will be reflected in the mining algorithm?
03:50:04 <m-relay> <j​0j0xmr:monero.social> 42
05:02:59 <m-relay> <r​brunner7:monero.social> monet: I answer despite monet being on Matrix.org - maybe we are lucky and this gets through: Full-chain membership proofs and RandomX are totally unrelated. The former won't replace the latter, in any case. There is an update for RandomX in the pipeline that makes some adjustments for modern CPUs, but that's it.
13:05:58 <m-relay> <p​reland:matrix.org> Eventually
21:59:35 <m-relay> <r​ecanman:kernal.eu> Hi,
21:59:37 <m-relay> <r​ecanman:kernal.eu> In the reference Edwards25519 implementation:
21:59:39 <m-relay> <r​ecanman:kernal.eu> ```python
21:59:41 <m-relay> <r​ecanman:kernal.eu> def encodepoint(P):
21:59:43 <m-relay> <r​ecanman:kernal.eu>     (x, y, z, t) = P
21:59:45 <m-relay> <r​ecanman:kernal.eu>     zi = inv(z)
21:59:47 <m-relay> <r​ecanman:kernal.eu>     x = (x * zi) % q
21:59:49 <m-relay> <r​ecanman:kernal.eu>     y = (y * zi) % q
21:59:51 <m-relay> <r​ecanman:kernal.eu>     bits = [(y >> i) & 1 for i in range(b - 1)] + [x & 1]
21:59:53 <m-relay> <r​ecanman:kernal.eu>     return bytes(
21:59:55 <m-relay> <r​ecanman:kernal.eu>         [sum([bits[i * 8 + j] << j for j in range(8)]) for i in range(b // 8)]
21:59:57 <m-relay> <r​ecanman:kernal.eu> (Line 2)
22:01:47 <m-relay> <r​ecanman:kernal.eu> Oops, this is **not** the reference implementation. This is a different one. Here is the reference implementation:
22:01:47 <m-relay> <r​ecanman:kernal.eu> ```python
22:01:49 <m-relay> <r​ecanman:kernal.eu> def encodepoint(P):
22:01:51 <m-relay> <r​ecanman:kernal.eu>   x = P[0]
22:01:53 <m-relay> <r​ecanman:kernal.eu>   y = P[1]
22:01:55 <m-relay> <r​ecanman:kernal.eu>   bits = [(y >> i) & 1 for i in range(b - 1)] + [x & 1]
22:01:57 <m-relay> <r​ecanman:kernal.eu>   return ''.join([chr(sum([bits[i * 8 + j] << j for j in range(8)])) for i in range(b/8)])
22:01:59 <m-relay> <r​ecanman:kernal.eu> ```
22:02:01 <m-relay> <r​ecanman:kernal.eu> I figured it out now, my apologies!
22:21:42 <selsta> please use paste.debian.net to share code
22:21:59 <m-relay> <r​ecanman:kernal.eu> Noted selsta