Oh no! Not Peter Cullen…
y a une game jam de création de jdr inspirés de Marathon (le jeu vidéo, de 2026) en septembre j'ai un peu le seum
j'aurais pas le temps de finir le mien je pense, jvais probablement poster une v1 un peu dégueulasse histoire quand même de publier un truc mais bon... j'aurais vraiment aimé finir mon truc en entier et bien proprement
Alex Akselrod
boosted
Ratko Mladic has died, aged 84. The Grim Reaper’s aim is getting better.
@Edent Also, we have to have a talk about our very similar project names!
@evan just writing it in raw PHP :-)
As long as you don't require *me* to shave my facial hair, I'm happy to chat!
let's check back to page 2:
1 Recent spectacular advances in discrete log algorithms have resulted in a quasi-polynomial algorithm for small-characteristic fields [3], but these advances are not known to apply to the prime fields used in practice.
this is not trying to help anyone!!!!! this is misstating a factoring technique essentially solved in the year 1978 as if it were news and then replaying NIST and IETF vulns while not advising anyone on how to spot and avoid misuse!
i wonder how the researchers from johns hopkins and microsoft would advise the audience--oh:
Transition to elliptic curves.
not a single citation to how or why elliptic curves work better. not a single thing but the mention of the bernstein curve by name, without a link! god forbid someone cross-reference any claim whatsoever
Thomas Citharel
boosted
The Server Called Paranoia: Defend Autistici/Inventati Before September 25
Hausdurchsuchung „klar unverhältnismäßig“: Neun Mann filzen eine Wohnung, weil eine Klimaaktivistin im Bahnhof gefälschte DB-Plakate aufgehängt haben soll https://taz.de/Adbusting-Aktion-Razzia-in-Oldenburg-wegen-gefaelschter-Bahn-Plakate/!6207283/
@CCC Und das, obwohl die noafd (noch) nicht an der Macht ist.
Wenn mal so gegen drohende, gewalttätige Rechtsradikale mit Schusswaffen vorgegangen würde.
Auf dem rechten Auge blind.
@brainofdane there’s something about the heavily anti-corporate work being provided to me by the very corporate dystopia it warns of while playing one of the most heavily corporatized game on the planet.
At least im doing it with eyes wide open.
@b4ux1t3 Very poetic! 😂 I've only recently gotten back into WoW, but I prefer WotLK era, so I just solo level on community WotLK servers... maybe I'm sticking it to the man by not giving Blizz any more of my money?
Panic refunds illegal tariffs customers paid on its Playdate gaming handheld
"It just felt like the right thing to do"
https://arstechnica.com/gaming/2026/08/panic-refunds-illegal-tariffs-customers-paid-on-its-playdate-gaming-handheld/?utm_brand=arstechnica&utm_social-type=owned&utm_source=mastodon&utm_medium=social
I think the #RFC9421 HTTP Signature algorithm should be explicitly included in #Mastodon's requests.
Feedback welcome - especially those explaining politely why I'm a wrong about this.
https://github.com/mastodon/mastodon/issues/29905#issuecomment-5440336919
@Edent Currently on vacation so I might misremember, but afair the algorithm is already determined by the key used. So including it would do no harm, but is kind of redundant.
Alex Akselrod
boosted
The deputy resigned after an investigation uncovered an alleged history of racism, stalking, and sexual abuse.
there has been zero progress on anything besides the completely fallacious "probabilistic algorithms" which were the reason quantum computing was "invented"
let's check back to page 2:
1 Recent spectacular advances in discrete log algorithms have resulted in a quasi-polynomial algorithm for small-characteristic fields [3], but these advances are not known to apply to the prime fields used in practice.
this is not trying to help anyone!!!!! this is misstating a factoring technique essentially solved in the year 1978 as if it were news and then replaying NIST and IETF vulns while not advising anyone on how to spot and avoid misuse!
tante
boosted
@tante I felt the same way when NVIDIA announced they were acquiring SchedMD (the people behind the SLURM high performance computing scheduler)
For the number field sieve, the complexity is
exp (k + o(1))(log N )1/3 (log log N )2/3),
that's still Omega(e^k) which is exponential
where
Nis the integer to factor or the prime modulus for discrete log,
that's literally not how it works. the chinese remainder theorem approach doesn't work on RSA's n = pq modulus and RSA is literally just diffie-hellman but worse for the actual asymmetric crypto part
and
kis an algorithm-specific constant. This formula is inherently imprecise, since theo(1)in the exponent can hide polynomial factors.
and they're lying about what's wrong, since as above exp(k) is exponential. really cute shit. go to hell
there has been zero progress on anything besides the completely fallacious "probabilistic algorithms" which were the reason quantum computing was "invented"
Alex Akselrod
boosted
🐦 Wild honeyguide birds learn the local call of their human hunting partners
Across Africa, greater honeyguides lead people to wild bee nests in exchange for beeswax. But the call used to recruit them is culturally specific. Yao hunters in Mozambique use a "brrr-hm" trill-grunt, while Hadza hunters in Tanzania use complex melodic whistles.
A 2023 Science paper tested this: honeyguides in Tanzania responded to Hadza whistles 82% of the time but only 24% to Yao calls. In Mozambique, the pattern flipped: 73% for local calls vs 26% for foreign. The birds learn these preferences. A hunter using the wrong call finds less than half as much honey.
Federico Mena Quintero
boosted
- actively does incredibly wrong shit with asymptotic complexity:> Without better parameter choices, we resort to extrapolating from asymptotic complexity.
the parameter choices were prescribed in 1978, two years after diffie-hellman was published, but sure, let's do some asymptotic complexity with evil debate bros who want to kill people, why not
For the number field sieve, the complexity is
exp (k + o(1))(log N )1/3 (log log N )2/3),
that's still Omega(e^k) which is exponential
where
Nis the integer to factor or the prime modulus for discrete log,
that's literally not how it works. the chinese remainder theorem approach doesn't work on RSA's n = pq modulus and RSA is literally just diffie-hellman but worse for the actual asymmetric crypto part
and
kis an algorithm-specific constant. This formula is inherently imprecise, since theo(1)in the exponent can hide polynomial factors.
and they're lying about what's wrong, since as above exp(k) is exponential. really cute shit. go to hell
hypebot
boosted
Partner: Open this for me?
Me: What are the magic words?
Partner: Please?
Me: ...
Partner: ...
Me: Squeamish...
Partner: ...
Me: Ossifrage.
Partner: looks up "Squeamish Ossifrage"
Partner: NERD!
