Fredchristus *,*
4K posts

Fredchristus *,*
@fredchristus
Catholic . Building decentralized future @rootescampHQ Ex @polkadot @injective




Folks might learn the hard way with $RAVE token, Binance and the MM behind it might deal with early shorters Just chill and allow it play out. No need to engage unless it gets close to $10+. Btw the next unlock (+4.5M) for RAVE is on the 12th of this month. So it would be smart to wait until the bullish unlock is over.


🚨 JUST IN: someone just used AI to hack @hyperbridge and walk away with $237K. the attacker used AI to craft a fake message that looked legit to the bridge. like a perfectly forged letter saying "i'm the new manager now." and the bridge believed it. once "promoted" to admin, the attacker minted 1 billion $DOT tokens out of thin air on ethereum, and dumped them for $237K before anyone noticed. → AI generates a forged cross-chain message → message passes through hyperbridge's gateway → bridge thinks it's real, executes it → attacker becomes admin of the token contract → mints 1B tokens → sells everything → gone crafting a valid-looking cross-chain message used to take weeks of manual reverse engineering. now an LLM can analyze the contract, find the weak validation logic, and generate the perfect forged payload in hours. and the most ironic part? hyperbridge literally published a post on april 1st called "The Hyperbridge Hack Explained" as a joke. they were flexing about how their ZK proof system made them "unhackable." 12 days later, someone proved them wrong.

Just In: Hackers minted 1 billion DOT tokens on the Ethereum mainnet and then sold them off. According to Certik, the attack was primarily due to a Hyperbridge gateway vulnerability, which allowed attackers to forge messages and manipulate the administrator of a Polkadot token contract on Ethereum, profiting approximately $237k.


announcing a mini solana dev weekend competition, $1,500 prize and bragging rights challenge: lowest latency algorithm for computing SOL PnL at runtime with no indexing and only RPC context: with existing solana RPC methods, you have getSignaturesForAddress and getTransaction the problem is gSFA only lets you traverse from recent -> old in one direction, so you are inherently capped on choice of algorithm with the new getTransactionsForAddress method however, you can start from start, end, middle, or any range you want and parallelize these calls to get 10x lower latencies the core challenge becomes "how do you search the set of transactions for an address the most efficiently given you do not know how sparse they are for a given wallet?" leave your submission as a DM or reply to this tweet as a gist or code sample and at the end of 2 days, I will run all the algorithms against each other for a set of addresses ranging from busy, sparse, and periodic. winner will be based on lowest avg latency

Morning flights are my favourite, and rows 1-3 are a must for me. So two weeks ago, I am on a flight to Lagos from Abuja, I am arranging my bags with my headphones on when I start hearing people go "your excellency sir", I turn around and it's my president sitting next to me!!!





My Yorùbá ancestors knew this and passed it down to us....they taught us the name of trees and shrubs and roots....they taught us how to speak to them and ask for their help when lost in the forest or when sick ....all of this is embedded in IFÁ...it's not new.








