00:11 < bridge_> if i had a nickel 01:59 < bridge_> Congratulations to everyone who benefited from my company yesterday. I still want more people to benefit. Ask me how And I will show on how you can earn $3500 in 24hours ... 01:59 < bridge_> ..join the telegram link below and Dm the Admin for more info 01:59 < bridge_> 👇👇👇👇👇👇👇👇 01:59 < bridge_> https://t.me/+s1mUKAv6bQMxOWE0 01:59 < bridge_> 01:59 < bridge_> https://t.me/+s1mUKAv6bQMxOWE0 01:59 < bridge_> Congratulations to everyone who benefited from my company yesterday. I still want more people to benefit. Ask me how And I will show on how you can earn $3500 in 24hours ... 01:59 < bridge_> ..join the telegram link below and Dm the Admin for more info 01:59 < bridge_> 👇👇👇👇👇👇👇👇 01:59 < bridge_> https://t.me/+s1mUKAv6bQMxOWE0 01:59 < bridge_> 01:59 < bridge_> https://t.me/+s1mUKAv6bQMxOWE0 02:29 < bridge_> w rizz 07:48 < bridge_> nobody has nickels now 08:15 < bridge_> https://github.com/ddnet/ddnet/issues/3411#issuecomment-1628300620 08:15 < bridge_> new comment i made 08:58 < bridge_> Everyone own idea 😬😬 08:58 < bridge_> need a vote 08:58 < bridge_> As If ppl understand the pros and cons xd 08:59 < bridge_> 😬 09:03 < bridge_> I think my approach is a superset of centralized accounts for ddnets only.. so we could start with that 😬 09:04 < bridge_> 😬😬 09:04 < bridge_> 😬😬😬😬😬 09:04 < bridge_> Just wait for ddnet in rust and sell it as ddnet 2.0 09:05 < bridge_> i wouldnt mind doing the backend 09:05 < bridge_> the auth sc 09:05 < bridge_> sv 09:05 < bridge_> we all know its gonna be in rust anyway 09:06 < bridge_> :gigachad: 09:06 < bridge_> I just dislike that a mod has to download a list of known users and their keys xd 09:06 < bridge_> hmm 09:06 < bridge_> it would be cool with gog 09:07 < bridge_> gpg 09:07 < bridge_> just let ddnet sign ur key 09:07 < bridge_> then u dont need verify 09:07 < bridge_> download 09:07 < bridge_> * 09:07 < bridge_> KISS 09:07 < bridge_> oh well u need to get the account info still 09:08 < bridge_> lets use zero knowledge proofs 09:08 < bridge_> u dont even need to send keys 09:09 < bridge_> :gigachad: 09:09 < bridge_> https://en.m.wikipedia.org/wiki/Zero-knowledge_password_proof 09:10 < bridge_> > A common use of a zero-knowledge password proof is in authentication systems where one party wants to prove its identity to a second party using a password but doesn't want the second party or anybody else to learn anything about the password. For example, apps can validate a password without processing it and a payment app can check the balance of an account without touching or learning anything about the amount.[1] 09:11 < bridge_> So basically like a public key 09:11 < bridge_> with pubkeys you don't need passwords 😉 09:11 < bridge_> but yes, this is the next best thing if one wanted to have passwords 09:12 < bridge_> rsa auth is kind of zk i think xd 09:13 < bridge_> not sure 09:14 < bridge_> the "zero knowledge" in "zero-knowledge proofs" is quite strong 09:14 < bridge_> https://en.m.wikipedia.org/wiki/Pairing-based_cryptography 09:14 < bridge_> its listed under zk 09:14 < bridge_> hmm 09:15 < bridge_> > Zero knowledge typesEdit 09:15 < bridge_> 09:15 < bridge_> Proof of knowledge: the knowledge is hidden in the exponent like in the example shown above. 09:15 < bridge_> Pairing based cryptography: given f(x) and f(y), without knowing x and y, it is possible to compute f(x×y). 09:15 < bridge_> Witness indistinguishable proof: verifiers cannot know which witness is used for producing the proof. 09:15 < bridge_> Multi-party computation: while each party can keep their respective secret, they together produce a result. 09:15 < bridge_> Ring signature: outsiders have no idea which key is used for signing. 09:15 < bridge_> mobile sucks 09:17 < bridge_> where can I find the quote? 09:18 < bridge_> https://en.m.wikipedia.org/wiki/Zero-knowledge_proof 09:19 < bridge_> under the types section 09:21 < bridge_> I don't understand the article well enough to conclude that RSA falls under it or not 09:21 < bridge_> however, I note that RSA is not mentioned in "Pairing-based cryptography" 09:31 < bridge_> true xd 10:17 < bridge_> lmao 10:17 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127876327333167154/IMG_20230710_101521.jpg 10:17 < bridge_> found this walking 10:18 < bridge_> imagine going out of ur house tho 10:18 < bridge_> :justatest: 10:30 < ws-client> in crypto we rust 11:05 < bridge_> This is why only 2 people use gpg. It's very meh design for normal people 11:07 < bridge_> I wouldn't consider RSA 0 knowledge but it is effectively 0 knowledge until someone finds a way to factor large primes 11:59 < bridge_> imagine learning ur private key 12:00 < bridge_> :giga_chad: 12:03 < bridge_> Let's just delay the account stuff until quantum computers are good enough that we can say. It's not secure sty 12:03 < bridge_> Sry 12:03 < bridge_> Or you can just memorize all your friends pubkeys and we only display pubkeys. "Oh there you are a173b5f82gf72e41ebc7aff" 12:05 < ChillerDragon> @ryozuki rust update! https://www.youtube.com/watch?v=JFY0ZF2XL8w 12:05 < bridge_> troll 12:05 < ChillerDragon> :p 13:03 < bridge_> im making a blog post 13:03 < bridge_> on implementing a hash map 13:13 < bridge_> put a hash table as table of content 13:17 < bridge_> xd 13:23 < bridge_> do share 🙂 13:31 < ws-client> what would you do if a std macro behaves different from it's description from the docs? 13:33 < ws-client> @ryozuki if the docs are a subset of what the implementation is actually doing, would u consider it safe to rely on the superset xD 13:34 < bridge_> idk xd 13:34 < bridge_> what docs 13:34 < bridge_> what macro 13:34 < bridge_> ill do when its done ye 13:34 < ws-client> https://doc.rust-lang.org/std/macro.env.html 13:34 < ws-client> env! 13:34 < bridge_> report a bug, likely 13:34 < ws-client> says its "yielding an expression of type &'static str" 13:34 < bridge_> what's the behavior differential 13:34 < bridge_> whats not doing? 13:34 < ws-client> but in fact it yields a string literal 13:34 < ws-client> and i need a string literal in this case xd 13:34 < bridge_> a string literal is an expression of type `&'static str` 13:35 < bridge_> xd 13:35 < bridge_> yeah 13:35 < ws-client> no 13:35 < bridge_> not the other way aroudn though 13:35 < ws-client> well ok 13:35 < bridge_> &'static str is a string literal lol 13:35 < bridge_> no 13:35 < bridge_> you can also reach it differently 13:35 < bridge_> String::leak, e.g. 13:35 < bridge_> `String::leak`, e.g. 13:35 < bridge_> im confused 13:36 < bridge_> whats the exact type u need 13:36 < bridge_> a string literal 13:36 < ws-client> a string li 13:36 < bridge_> for a macro, likely 13:36 < ws-client> basically "hi" 13:36 < bridge_> ah 13:36 < ws-client> yes 13:36 < ws-client> for another macro 13:36 < bridge_> Jupstar: create a PR to add "string literal" to the doc of `env!` 13:36 < bridge_> profit 13:36 < bridge_> well the docs are correct 13:37 < ws-client> they are not incorrect xD 13:37 < bridge_> Jupstar just wants more guarantees 13:37 < bridge_> than they give 13:37 < bridge_> ahh 13:37 < bridge_> i get it now 13:37 < bridge_> well its better its actually a string literal 13:37 < bridge_> yes 13:37 < bridge_> and i think the guarantee is there 13:37 < bridge_> because changing would be a breaking change 13:37 < ws-client> well rust has no spec yet right? 13:38 < bridge_> hmm. to be on the safe side, you should probably add it to the docs 13:38 < bridge_> but it has a backwards compat promise 13:38 < bridge_> theoretical breaking changes that affect no one are sometimes done 13:38 < bridge_> I guess this one is widely used already, though, so you should be fine 13:38 < bridge_> If a crate compiled at some point, then Rust's stability guarantees say that it'll still compile afterwards. 13:39 < bridge_> the editions fix that 13:39 < bridge_> "breaking" changes are done on editions 13:39 < bridge_> I'm sure that this has been broken several times already 13:39 < bridge_> but they are mild 13:39 < bridge_> so old crates use old editions 13:39 < bridge_> they still compile 13:39 < bridge_> with newer 13:39 < bridge_> note also the future-incompatibility warnings 13:39 < bridge_> that you get these days 13:39 < bridge_> i dont think they will downgrade env 13:39 < bridge_> to a non literal 13:39 < bridge_> anyway 13:39 < bridge_> me too 13:40 < bridge_> just saying that the guarantees aren't as absolute as you make them to be 13:40 < bridge_> ok 13:44 < ws-client> is just the questions are environment variables always string literals? 13:44 < ws-client> "value of the named environment variable at compile time" 13:44 < ws-client> then i dont need to pr 13:44 < ws-client> xd 13:47 < bridge_> not really 13:48 < ws-client> what else can they be then? just wondering 13:48 < ws-client> bcs i bet the maintainers will argue like that 13:53 < bridge_> it could be an expression of that type 13:54 < bridge_> e.g. `{"abc"}` 13:54 < bridge_> or `{static VALUE: &str = "abc"; VALUE}` 13:54 < bridge_> the rust maintainers are generally not opposed to improving documentation 13:54 < bridge_> they might be opposed to adding more guarantees, but I don't think they will be in this case 13:56 < bridge_> e.g. stuff like this: 13:56 < bridge_> ``` 13:56 < bridge_> warning: the following packages contain code that will be rejected by a future version of Rust: buf_redux v0.8.4, multipart v0.18.0 13:56 < bridge_> ``` 13:56 < bridge_> @ryozuki ^ 13:56 < ws-client> i have never seen a environment variable holding an expression as value. But is the question is rust itself defines a value of a environment variable a string literal 13:57 < bridge_> I think we're talking past each other 13:57 < bridge_> I mean the macro could expand to something like this when the environment variable is just `abc` 13:57 < bridge_> I mean the macro could expand to something like this when the environment variable has `abc` as its value 13:58 < ws-client> Oh, i simply meant bcs the doc says "This macro will expand to the value of the named environment variable at compile time". So i wondered if this is guarantee enough, as in "A value of a named env var is ALWAYS a string literal" 13:59 < bridge_> `{"abc"}` also suffices that guarantee 13:59 < bridge_> (if the environment variable's value is `abc`) 14:00 < bridge_> anyway 14:00 < ws-client> but is that THE value of the env var xD 14:00 < bridge_> sure 14:00 < bridge_> anyway, I think you can get away with relying on it without a PR, too 14:01 < ws-client> i'll test once gcc has rust backend 😂 14:13 < ws-client> i wonder if i could write a game in vulkan inside a proc macro or if there is any limitation 14:21 < bridge_> a proc macro is a full-blown rust program 14:21 < bridge_> derive macros are where rust macros shine 14:22 < bridge_> macro_rules only generates code 14:22 < bridge_> derive macro transforms code 14:22 < bridge_> proc macro is a derive macro 14:22 < bridge_> a derive macro is a proc macro 14:22 < bridge_> not the other way around, I think 14:22 < bridge_> true xd 14:24 < ws-client> funny. imagine u compile ddnet and while compiling u can play ddnet 14:24 < ws-client> xd 14:39 < bridge_> https://edgarluque.com/blog/rust-hashmap/ 14:39 < bridge_> xd 14:39 < bridge_> sometimes i cringe myself reading myself 14:45 < bridge_> @heinrich5991 remember the issue we talked in the past 14:45 < bridge_> about quadratic probing 14:45 < bridge_> there are certain quadratic polynomials that do a full cycle 14:45 < bridge_> or so i read 14:46 < bridge_> `h(k) + (i + i^2) / 2` 14:46 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127944007150993409/image.png 14:46 < bridge_> picture for math 14:47 < bridge_> ah well 14:47 < bridge_> idk 14:47 < bridge_> xDD 14:48 < bridge_> but apparently the quadratic function is arbitrarely chosen 14:48 < bridge_> i wonder if there is a ist of good ones 14:48 < bridge_> list 14:55 < bridge_> i wanna post this on the rust reddit 14:56 < bridge_> but im afraid of having done smth wrong 14:56 < bridge_> im no expert xd 14:56 < bridge_> dont wanna be shamed 14:56 < bridge_> :justatest: 14:56 < bridge_> it's fine. they won't shame you. not sure whether they'll give you attention though, which can be even worse 14:57 < bridge_> Use fake account 14:57 < bridge_> Fake blog 14:57 < bridge_> i had good experiences in the past 14:57 < bridge_> all the posts i put reached frontpage 14:57 < bridge_> xd 14:57 < bridge_> ill just do it 14:58 < bridge_> you forgot `#![deny(unsafe)]` though 14:58 < bridge_> meh its ok 14:58 < bridge_> there is no unsafe 14:58 < bridge_> xd 14:58 < bridge_> https://www.reddit.com/r/rust/comments/14vtc8f/implementing_a_simple_hashmap_in_rust/ 14:58 < bridge_> :justatest: 14:59 < bridge_> ``` 14:59 < bridge_> linear probing 10 time: [255.08 ns 256.75 ns 258.66 ns] 14:59 < bridge_> quadratic probing 10 time: [252.66 ns 252.96 ns 253.25 ns] 14:59 < bridge_> 14:59 < bridge_> linear probing 100 time: [3.7110 µs 3.7169 µs 3.7236 µs] 14:59 < bridge_> quadratic probing 100 time: [3.6763 µs 3.6783 µs 3.6803 µs] 14:59 < bridge_> 14:59 < bridge_> linear probing 1000 time: [32.555 µs 32.703 µs 32.906 µs] 14:59 < bridge_> quadratic probing 1000 time: [32.002 µs 32.046 µs 32.126 µs] 15:00 < bridge_> 15:00 < bridge_> linear probing 10000 time: [464.28 µs 464.39 µs 464.53 µs] 15:00 < bridge_> quadratic probing 10000 time: [453.38 µs 454.40 µs 455.71 µs] 15:00 < bridge_> 15:00 < bridge_> linear probing 100000 time: [6.4169 ms 6.4213 ms 6.4267 ms] 15:00 < bridge_> quadratic probing 100000 time: [6.3506 ms 6.3548 ms 6.3601 ms] 15:00 < bridge_> ``` 15:00 < bridge_> these are my bench 15:00 < bridge_> pub type Hashmap=std::collections::hashmap 15:00 < bridge_> but idk maybe simd or smth makes quadratic faster 15:00 < bridge_> No troll no life 15:00 < bridge_> xd 15:00 < bridge_> did you compile with -march=native -mavx2 ? 15:01 < bridge_> @ryozuki `(from what i have seen)` capitalize the I 15:01 < bridge_> i hate that 15:01 < bridge_> from english 15:02 < bridge_> fixed 15:02 < bridge_> <_voxeldoesart> no one cares about lowercase i lol 15:02 < bridge_> I thought quadratic probing was mostly used to avoid "clumping" 15:03 < bridge_> <_voxeldoesart> i sure dont care 15:05 < bridge_> > Quadratic probing can be a more efficient algorithm in an open addressing table, since it better avoids the clustering problem that can occur with linear probing, although it is not immune. It also provides good memory caching because it preserves some locality of reference; however, linear probing has greater locality and, thus, better cache performance 15:06 < bridge_> seems true 15:06 < bridge_> in case you care about another typo: Wehther -> Whether 15:07 < bridge_> i do care 15:07 < bridge_> As a closed addressing enjoyer I don't have such problems :gigachad: 15:07 < bridge_> linked list enjoyer :justatest: 15:07 < bridge_> nice blog btw :) 15:07 < bridge_> I'm being ostracized for enjoying the classics 15:08 < bridge_> ty! 15:09 < bridge_> > `residuez` requires Signal Processing Toolbox. 15:09 < bridge_> :pepeW: 15:09 < bridge_> I have so many toolboxes 15:11 < bridge_> whats that 15:11 < bridge_> matlab stuff? 15:11 < bridge_> Yes, matlab 15:12 < bridge_> say no more 15:12 < bridge_> :p 15:12 < bridge_> My computer feels dirty now 15:15 < bridge_> now that i reread 15:15 < bridge_> i could refactor most code into find_slot_idx so the non mut and mut functions are small 15:15 < bridge_> and also the quadratic thing 15:16 < bridge_> maybe another day im feeling lazy now xD 15:25 < bridge_> Thanks proprietary shitware, very cool 15:25 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127953799672242289/prop.png 15:26 < bridge_> <_voxeldoesart> >something unexpected 15:27 < bridge_> <_voxeldoesart> they are incompitent 15:27 < bridge_> and there are no logs 15:28 < bridge_> I tried again and it just worked, thanks proprietary shitware 15:51 < bridge_> I hate references like this, the book is 900 pages, where am I supposed to look? 15:51 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127960220124057651/image.png 15:52 < bridge_> its cuz they dont use latex 15:52 < bridge_> is the thing u making not deterministic? 15:52 < bridge_> random? xd 15:54 < bridge_> I was trying to install a matlab addon, so no it's not supposed to be non-deterministic 😄 15:59 < bridge_> @deen u work in databases with dataflow stuff? 16:00 < bridge_> maybe u interested in this 16:00 < bridge_> https://github.com/hydro-project/hydroflow 16:36 < bridge_> Yeah, sounds cool and pretty similar to the timely+differential dataflow we use 16:36 < bridge_> https://matthewrayfield.com/articles/animating-urls-with-javascript-and-emojis/#%E2%A0%80 16:36 < bridge_> https://matthewrayfield.com/articles/animating-urls-with-javascript-and-emojis/ 16:37 < bridge_> has anyone here used racket 16:38 < bridge_> no but i hear it often 16:38 < bridge_> functional 16:44 < bridge_> i have to use it for a placement and its giving me brain damage :feelsbadman: 16:46 < bridge_> nice 16:46 < bridge_> learn it a lot 16:46 < bridge_> i need more excuses to learn more langs 16:47 < bridge_> xd 16:47 < bridge_> otherwise im lazy and dont 16:50 < bridge_> learn a lang in non-english syntax 16:57 < bridge_> :hypervomit: 16:58 < bridge_> I helped friends of mine study for a racket exam, honestly by far the worst way to teach programming, if you are going to be forcing students to start with a functional language atleast make it something relevant like Haskell 16:58 < bridge_> What is the point of teaching a dead lisp? 16:59 < bridge_> Well not dead, but it's only used by weird professors and their weird professor friends to do weird professor things 17:00 < bridge_> yeah the professor of the class is one of the dudes who was involved with some aspect of development 17:00 < bridge_> Not surprised at all 17:01 < bridge_> it seemed like the lang was supposed to somewhat simulate how computer hardware works or smth 17:01 < bridge_> but the syntax makes me want to kms 17:01 < bridge_> If your language has less than 100 users you shouldn't be allowed to teach it as a beginner course 17:01 < bridge_> That's what Lisplikes do to you 17:03 < bridge_> I mean, it's not even close to how the underlying hardware runs your code. Functional programming languages are how computer science professors wish programming looked like so they can use their fancy math tools instead of learning ours. 17:04 < bridge_> but isnt lisp the best lang 17:04 < bridge_> (It does work to some degree, look at haskell, you can even mathematically prove stuff about haskell programs) 17:04 < bridge_> fans of lisps are die hard 17:04 < bridge_> harder than rust 17:05 < bridge_> the cto of my company loves lisp 17:05 < bridge_> but i dont think he uses it on projects xd 17:05 < bridge_> `(+ 1 2 3 4)` my favourite way to write 1 + 2 + 3 + 4, very intuitive 17:05 < bridge_> @deen would like to interject? 17:05 < bridge_> i think deen likes lisp 17:05 < bridge_> they have me making lists using nested constructors :greenthing: 17:05 < bridge_> I have never used a lisp 😄 17:05 < bridge_> xD 17:06 < bridge_> @deen is a haskell enjoyer iirc 17:06 < bridge_> (cons "A" (cons "B" (cons "C" '()))) 17:06 < bridge_> @louis.place try leanring erlang lololo 17:06 < bridge_> it also got ugly af syntax 17:07 < bridge_> well not as ugly as that 17:07 < bridge_> it probably doesnt end up with )))})) at the end of a line lol 17:07 < bridge_> ```erlang 17:07 < bridge_> -module(series). 17:07 < bridge_> -export([fib/1]). 17:07 < bridge_> 17:07 < bridge_> fib(0) -> 0; 17:07 < bridge_> fib(N) when N < 0 -> err_neg_val; 17:07 < bridge_> fib(N) when N < 3 -> 1; 17:07 < bridge_> fib(N) -> fib_int(N, 0, 1). 17:07 < bridge_> 17:07 < bridge_> fib_int(1, _, B) -> B; 17:07 < bridge_> fib_int(N, A, B) -> fib_int(N-1, B, A+B). 17:07 < bridge_> ``` 17:08 < bridge_> lol wot 17:08 < bridge_> when N < 3? 17:08 < bridge_> more like when N < 2 17:08 < bridge_> oh it's fibonacci, not factorial 😄 17:08 < bridge_> no i think its saying 0,1,1 17:08 < bridge_> lol 17:09 < bridge_> People who enjoy Lisp also enjoy stuff like lambda calculus 17:09 < bridge_> ```erlang 17:09 < bridge_> -define(IP_VERSION, 4). 17:09 < bridge_> -define(IP_MIN_HDR_LEN, 5). 17:09 < bridge_> 17:09 < bridge_> DgramSize = byte_size(Dgram), 17:09 < bridge_> case Dgram of 17:09 < bridge_> < ID:16, Flgs:3, FragOff:13, 17:09 < bridge_> TTL:8, Proto:8, HdrChkSum:16, 17:09 < bridge_> SrcIP:32, 17:09 < bridge_> DestIP:32, RestDgram/binary>> when HLen>=5, 4*HLen= 17:09 < bridge_> OptsLen = 4*(HLen - ?IP_MIN_HDR_LEN), 17:09 < bridge_> <> = RestDgram, 17:09 < bridge_> ... 17:10 < bridge_> end. 17:10 < bridge_> ``` 17:10 < bridge_> erlang has a neat feature tho 17:10 < bridge_> bit manipulation 17:10 < bridge_> https://www.erlang.org/doc/programming_examples/bit_syntax.html 17:11 < bridge_> lambda calculus is the most simple turing complete language 17:11 < bridge_> based 17:11 < bridge_> unbased, it gives me a headache 17:19 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127982370495139840/image.png 17:19 < bridge_> someone downvotes me 17:19 < bridge_> 17:19 < bridge_> someone downvoted me 17:26 < bridge_> 9th post in r/rust frontpage 17:30 < bridge_> xd 17:39 < bridge_> reddit famous :poggers: 17:39 < bridge_> https://media.discordapp.net/attachments/919318424163856415/1050553033823625257/SHTO.gif 17:45 < bridge_> i do 17:57 < bridge_> omg 17:57 < bridge_> robyt god 18:05 < bridge_> :greenthing: 18:05 < bridge_> https://cdn.discordapp.com/attachments/293493549758939136/1127994120988790897/image.png 18:06 < bridge_> after unsuccessful update 18:23 < bridge_> redownload client from https://ddnet.org/downloads/ 18:42 < bridge_> I recommend to have it on steam and keep it updated that way 18:42 < bridge_> To ensure for no problems 18:48 < bridge_> Posting links without context is a mutable offense. When a discord mod sees this he will censor you! 18:48 < bridge_> (@heinrich5991) 18:49 < bridge_> cool blog tho I rate 7/10 18:55 < bridge_> what about mine chillerdragon 19:08 < bridge_>