forloop (@forloopcodes) header
forloop (@forloopcodes) profile picture

hypergamy climber at aftermatter corp. (https://xitter.twitterapi.xyz/t.co/e7TqX6aab0), shrike ⚡︎, contextplus (2k) and cargo install safeinstall. forloop@poke.com

college wifi torrent seeder
Joined September 2024
Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)Photo by forloop (@forloopcodes)
Sure! Here's how the tightest (known) packing of 67, 6767 and 676767 squares in a larger square looks like: I made the most optimized algorithm to find out the tightest packing of n smaller squares in a larger square test it out: forloopcodes.github.io/least… (runs on your gpu) more details: input: n (number of squares) intermediate: s (side length) output: [[x, y, angle]*n] (array of position of each square) solver (squarepack): pack(n) returns (s, [[x, y, angle], …]) scale: n=100000 in about 4 s, 0.08 s in browser, n=1000001 in 0.2 s. verifier: p_ij = ½ + (|cos φ| + |sin φ|)/2 − max_a |a·(c_i − c_j)|, φ = θ_j − θ_i flow: 1. best of all in O(n): Grid ⌈√n⌉, Göbel strip/square families, L-extensions, the √7 family, DeVincentis,Wainwright 19, Schadt 50/171 2. cache lookup 3. tilted-block search: p×q block rotated 45°, remaining space filled by walls anchoring 4. numerical compaction: Penalty energy E = Σ max(0,penetration)² + Σ max(0,protrusion)², analytic gradient, L-BFGS, shrink s by bisection, basin-hopping. github: github.com/forloopcodes/leas…
I'm sure you always wanted to know how the tightest (known) packing of "n" squares within a larger square looks like... 😍
2
1
1
22
8,018
forloop retweeted
at least, it wasn't exactly ai that took his job
1
4
110
ok looks like Jensen maybe out now
77
12
3
1,553
62,654
BREAKING: NVIDIA CEO Jensen Huang resigns
867
7,495
3,834
40,722
2,124,382
Jensens downfall is drazy
1
1
156
largest bank of india btw
84
105
18
2,541
254,887
no not you too 😭😭 you cant just say that with a straight face and list my blog as the source 😭😭😭
okay so even after writing a blog post about how i did not actually get a million dollars there are still ai-generated news articles coming out claiming i did EXCEPT NOW THEY ALSO LINK TO MY BLOG AS THE SOURCE???????
23
11
2
430
5,712
vaguepost god is when i write an entire blog post explaining in detail what happened
1
19
148
Post your proudest block below
7
57
1,228
turkish men are usually chill why did he block you?
1
2
59
only the one with red pfp
1
2
26
"github copilot is free for students (auto model selection only)" son im crine
40
51
3
5,670
189,270
Is deepseek free better?
1
1
21
not good but better than luna
1
15
if you’re in paris you may be able to catch me and get the new helium stickerpack allegedly
successfully moved to paris
49
23
4
2,024
23,703
can i get one 👉👈
1
87
forloop retweeted
Any telegram message can now become RCE 6630b003766baed1fa86cea880d22e41dc416f63d800de3246941ede2396ad48
Any Telegram message can now become an app. ⚡ Downloads instantly (less than 4 KB)
🎨 Interactive and natively rendered
💸 Payments and viral mechanics built in 🛠️ Build your own. More info and docs for devs: t.me/BotNews/122
84
213
90
2,525
273,949
imagine if google colab had intellisense and code documentation and not gemini
4
1
26
732
i hacked a cli and just let my clancker deal with that shit
1
2
33
to the guy who bookmarked it PLEASE I BEG YOU I WILL PAY FOR IT
1
1
141
okay windows search is actually getting better, infact its the fastest ever
1
8
412
HOLY MOTHER OF GOOD NEWS pls let it work let it work let it work this post will remain vague until I get the OK to be excited publicly but YAAAAAAAY
22
1
151
1,610
Fable is right more often than Carbon, but Carbon is wrong less often than Fable *according to omniscience
25
13
2
642
30,134
what are the chances that the model made up a correct answer without actually knowing it
284
forloop retweeted
sigh
holy shit, this is literally AGI.
4
5
495
32,295
Introducing e-means, an algorithm beating k-means in 10x fewer epochs. With order of magnitude wall-clock speedups, e-means is released in FAISS and needs no hyperparameter tuning beyond k. It is robust to various scales and datasets. Still skeptical ? Just try e-means [1/10]🧵
145
1,189
249
10,027
829,033
i might sound dumb but is it like comparing mcts with alpha beta?
77
aura monster
13
1,555