Dict Hash Collision DOS Slows Lookups From 1ms To 47 Seconds?!

HASH COLLISION DISASTER! Attacker crafts colliding keys! Dict becomes linked list! O(1)→O(n) lookup! 47 seconds per request! Complete outage! 470K users logged out! $2.3M lost! Infrastructure FIRED!

#python #pythondisaster #hashcollision #dosattack #dictperformance #productionbug #pythonshorts #pythonwtf #o(n)lookup #careerending #sessionstorage #algorithmiccomplexity

https://www.youtube.com/watch?v=f6WZj-_xj5c

Dict Hash Collision DOS Slows Lookups From 1ms To 47 Seconds?! #pythonwtf

YouTube

Solving ARC (well... up to 20%) with inference-time compression. Another indication that #MDL and #AlgorithmicComplexity are becoming relevant in the age of Deep Learning.

https://iliao2345.github.io/blog_posts/arc_agi_without_pretraining/arc_agi_without_pretraining.html

ARC-AGI Without Pretraining

iliao2345

Zenil et al describe an algorithmic causal deconvolution method that disentangles the dimensions which originally provided meaning to the sequence solely by analysing the sequence based on algorithmic information dynamics.

https://arxiv.org/pdf/2303.16045

But how does that relate to transformers?

#AlgorithmicInformationTheory #AlgorithmicComplexity #CausalDeconvolution

MITx: Introduction to Computer Science and Programming Using Python.

This free beginner course teaches computational thinking and programming using #Python 3.5. It covers #computation, #algorithms, #testing, #debugging, #AlgorithmicComplexity , and #DataStructures.

⚠️ The course requires significant time and effort.

https://www.edx.org/learn/computer-science/massachusetts-institute-of-technology-introduction-to-computer-science-and-programming-using-python?ref=aitoolsclub.com

#MIT #ComputerScience #Programming #compsci

MITx: Introduction to Computer Science and Programming Using Python. | edX

An introduction to computer science as a tool to solve real-world analytical problems using Python 3.5.

edX
Seth Lloyd - What is Complexity in the Cosmos?

YouTube

Some nifty #DataStructures are to be found in this #HackerNews #thread:

"Ask HN: What Are Some Cool But Obscure Data Structures You Know About?" (https://news.ycombinator.com/item?id=32186203).

#DS #Data #Efficiency #Speed #Performance #Optimization #AlgorithmicComplexity #CS #ComputerScience

Ask HN: What are some cool but obscure data structures you know about? | Hacker News

Matrix Multiplication Inches Closer to Mythic Goal

A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to make improvements.

Quanta Magazine
Parsing can become accidentally quadratic because of sscanf · Issue #40 · biojppm/rapidyaml

While investigating a performance issue in a library I am working on, I noticed that parsing a particular document (warning: very large file) causes the program to spend a lot of time in memchr (ro...