01:50:12 <m-relay> <t​eebuthot:matrix.org> Get in touch with this platform for greatness you’ll definitely thank me later       
01:50:13 <m-relay> <t​eebuthot:matrix.org> ℹ️❤️.        
01:50:15 <m-relay> <t​eebuthot:matrix.org>      👇👇👇👇👇
01:50:17 <m-relay> <t​eebuthot:matrix.org> https://t.me/+zEFPK-AiVFEyZDM0
01:52:13 <m-relay> <t​eebuthot:matrix.org> Get in touch with this platform for greatness you’ll definitely thank me later       
01:52:13 <m-relay> <t​eebuthot:matrix.org> ℹ️❤️.        
01:52:15 <m-relay> <t​eebuthot:matrix.org>      👇👇👇👇👇
01:52:17 <m-relay> <t​eebuthot:matrix.org> https://t.me/+zEFPK-AiVFEyZDM0
08:39:48 <m-relay> <b​inarybaron:matrix.org> Small question regarding Monero seeds:
08:39:49 <m-relay> <b​inarybaron:matrix.org> I'm trying to from a `pre-existing random bytes -> Monero seed -> pre-existing random bytes`.
08:39:51 <m-relay> <b​inarybaron:matrix.org> As far as I understand this is not possible because the bytes need to form a valid Ed25519 scalar. My bytes however are randomly distributed. Therefore this isn't possible.
08:39:53 <m-relay> <b​inarybaron:matrix.org> Is this correct?
08:43:28 <m-relay> <s​yntheticbird:monero.social> Yes
08:45:03 <m-relay> <s​yntheticbird:monero.social> You can "pre-existing random bytes -> Monero seed" by derivating a point or clamping 256 random bits, but you couldn't by the point itself return to your original random bytes. That's a one way function
08:45:41 <m-relay> <s​yntheticbird:monero.social> and also pigeonhole problem
08:48:56 <m-relay> <b​inarybaron:matrix.org> Hmm, that's a bummer but thanks