One of the largest web3 games by daily active users, @pixels_online has a live economy spanning $PIXEL, land NFTs, a player marketplace, and much more.
They were already doing scheduled pentests and running a public bug bounty when we started working together.
The problem: they were shipping faster than point-in-time security could keep up.
So we started working continuously, across auth, game systems, on-chain rewards, and open-source releases.
Read the full story:
https://t.co/HnjQqg9F55
I tested how much “Make no mistakes.” actually helps.
Used Borg Code to generate two landing pages with the exact same prompt - the only difference is that one run included “Make no mistakes.”
PROMPT:
“Build a polished landing page for ‘NebulaVault’, an AI cybersecurity SaaS that finds critical vulnerabilities in pull requests before production. Make it visually premium: dark theme, glowing gradients, hero section, dashboard mockup, feature cards, social proof, and strong CTA buttons.”
Can you guess which is which?
Prove me wrong:
There is a critical vulnerability hiding in your codebase right now.
I’ve spent months building Mjolnir with @borghq, and so far, it keeps finding the issues teams thought weren’t there.
DM me if you’re up for the challenge.
@nishantkumar07 quant funds running 50 PhDs and $50 million infra just to crank out 1% returns, while Andurand is giving out huge bonuses just because boats are blowing up in some middle eastern strait
Sure, many LLMs deflect on gender, war, or Israel-Palestine. But that's because there is no objective truth on those topics. What you're calling "truth" is just your own convictions. Wanting an LLM to express that is the equivalent of wanting your Mr. Potato Head to start talking. An LLM simply cannot express "the truth". What you actually want is an AI that echoes your voice back at you, and labeling that as truth-seeking doesn't make it so. It just makes it a more agreeable echo chamber.
Stacking Poker Chips
Have you ever shuffled two stacks of poker chips by perfectly interleaving them, one chip from each stack at a time?
If you keep repeating that same shuffle, how long does it take before the chips return to their original order?
The answer is much stranger than you might expect.
If you have no idea what I'm talking about: https://t.co/DwL0YuoExt
The Final Step
After 1 shuffle -> multiply by 2
After 2 shuffles -> multiply by 2^2
After k shuffles -> multiply by 2^k
The stack returns to its original order when 2k ≡ 1(mod(2n−1)).
So the minimum number of shuffles is the smallest k where this happens.