DDraceNetwork - developer

Mr.Gh0s7 2024-10-22 09:43

Learath2

Stopped contributing to ddnet, made something actually useful

Hop on gw2

TIL that i32::MAX is a (mersenne) prime number

I could've lived without that information but now I'll read posts about that topic for 2 hours. Let's go

Ryozuki

TIL that i32::MAX is a (mersenne) prime number

That's lucky

yesterday I learned that 2^136279841 - 1 is prime

ye

10:27

https://www.johndcook.com/blog/2024/10/21/new-mersenne-prime-found/

John

New Mersenne prime found

New record sized prime, the 52nd known Mersenne prime

10:27

discovered yesterday

10:28

fun fact, in hex its represented like this

Did you know that we don't know whether there are infinite Mersenne primes or not?

yeah

Learath2

Stopped contributing to ddnet, made something actually useful

It would even be practical if it wasn't for the awful latency :)

11:14

ok maybe I'm just picky but even the latency on my Wacom tablet irritates me sometimes

Hello everyone, can you send me the link to download ddnet to your phone?

13:57

, cat1x

Hello everyone, can you send me the link to download ddnet to your phone?

https://discord.com/channels/252358080522747904/1277345584080097320/1295497728226365523 owo

Learath2

Did you know that we don't know whether there are infinite Mersenne primes or not?

i dont get why there wouldnt be infinite of them if you got infinite numbers to deal with

cyberfighter 2

i dont get why there wouldnt be infinite of them if you got infinite numbers to deal with

Well we don't really understand primes very well. Their distribution is a bit of a mystery. It's easy to show that there are infinite primes, but it's not at all easy to show that there are infinite primes of the type 2^k - 1

https://runjs.app/ watafak is this pepeW

15:52

20 clams for a program which runs js code for you (edited)

https://math.stackexchange.com/a/3985396 there is this dude on stackexchange that claims they proved that it's finite using excel in the appendix of a paper they wrote (edited)

Are there infinitely many Mersenne primes?

known facts : $1.$ There are infinitely many Mersenne numbers : $M_p=2^p-1$ $2.$ Every Mersenne number greater than $7$ is of the form : $6k\cdot p +1$ , where $k$ is an odd number $3.$ There are

15:54

I have my doubts

hello everyone

hello all 8 billion ppl

nikitqwzx

hello everyone

wazzup, what's on your heart today

$kog

cucumber

$kog

KoG affiliation

First and foremost: DDNet and KoG aren't affiliated. If you need help on a server related to KoG, join their Discord server by clicking on the link below.

URL:

https://discord.kog.tw/

MilkeeyCat

https://runjs.app/ watafak is this pepeW

I'm sure they've managed to fish some noobs with this scam

risu

I'm sure they've managed to fish some noobs with this scam

People who buy it should be ashamed of themselves to the rest of their lives

Ryozuki

fun fact, in hex its represented like this

just like all mersenne primes

1

Learath2

https://math.stackexchange.com/a/3985396 there is this dude on stackexchange that claims they proved that it's finite using excel in the appendix of a paper they wrote (edited)

fermat long lost descendant

https://www.memorysafety.org/blog/rustls-performance-outperforms/

Rustls Outperforms OpenSSL and BoringSSL

ISRG has been investing heavily in the Rustls TLS library over the past few years. Our goal is to create a library that is both memory safe and a leader in performance. Back in January of this year we published a post about the start of our performance journey. We've come a long way since then and we're excited to share an update on Rustls perfo...

Robyt3

[ddnet/ddnet] Pull request opened: #9164 Add log_*_color macros, deprecate IConsole::Print

Add log_error_color, log_warn_color, log_info_color, log_debug_color and log_trace_color macros to wrap log_log_color function with specific log levels. Add comment to mark the IConsole::Print function as deprecated in favor of the log_* functions, which should be preferred for the following reasons:

They support printf-formatting without a separate buffer.
They support all five log levels.
They do not require a pointer to IConsole to be used.
Consistency ...

Ryozuki

https://www.memorysafety.org/blog/rustls-performance-outperforms/

how do they guarentee security on side channels such as time ?

ask them

i know that's sometimes already hard enough with C, gotta be even harder with rust

how so?

18:55

both C (clang) and rust use llvm

18:56

rustls is mostly done by amazon team iirc

18:56

https://github.com/aws/aws-lc-rs

GitHub - aws/aws-lc-rs: aws-lc-rs is a cryptographic library using ...

aws-lc-rs is a cryptographic library using AWS-LC for its cryptographic operations. The library strives to be API-compatible with the popular Rust library named ring. - aws/aws-lc-rs

18:57

While Rustls itself is platform independent, by default it uses aws-lc-rs for implementing the cryptography in TLS. See the aws-lc-rs FAQ for more details of the platform/architecture support constraints in aws-lc-rs. ring is also available via the ring crate feature: see the supported ring target platforms.

because high level compiler will optimize code

18:58

and thus break time/power equality between branches

idk

18:58

maybe they use inline asm

18:58

i dont rly want to look this now xd but i doubt such a big project didnt consider this stuff

yeah, obviously they care about this or nobody would use their lib. Im just curious on how they handle it

apparently rustls complies with this too https://en.wikipedia.org/wiki/FIPS_140-2

FIPS 140-2

The Federal Information Processing Standard Publication 140-2, (FIPS PUB 140-2), is a U.S. government computer security standard used to approve cryptographic modules. The title is Security Requirements for Cryptographic Modules. Initial publication was on May 25, 2001, and was last updated December 3, 2002. Its successor, FIPS 140-3, was approv...

19:00

well whathever latest fips is

19:00

https://en.wikipedia.org/wiki/FIPS_140-3

FIPS 140-3

The Federal Information Processing Standard Publication 140-3 (FIPS PUB 140-3) is a U.S. government computer security standard used to approve cryptographic modules. The title is Security Requirements for Cryptographic Modules. Initial publication was on March 22, 2019 and it supersedes FIPS 140-2.

Chairn

yeah, obviously they care about this or nobody would use their lib. Im just curious on how they handle it

i know in llvm u can put function attributes to tell llvm to not optimize a specific function for example

how can you ever guarantee constant time if the cpu itself can optimize your machine code?

you can also deactivate some cpu opts for critic kernel. you just have to reduce leaks to noise level

anybody playing factorio?

19:04

the factory must grow (in space)

I played 7 hours yesterday

i played like 2

19:04

need more time