- Topic1/3
20k Popularity
12k Popularity
36k Popularity
8k Popularity
22k Popularity
- Pin
- 🎉 The #CandyDrop Futures Challenge is live — join now to share a 6 BTC prize pool!
📢 Post your futures trading experience on Gate Square with the event hashtag — $25 × 20 rewards are waiting!
🎁 $500 in futures trial vouchers up for grabs — 20 standout posts will win!
📅 Event Period: August 1, 2025, 15:00 – August 15, 2025, 19:00 (UTC+8)
👉 Event Link: https://www.gate.com/candy-drop/detail/BTC-98
Dare to trade. Dare to win.
- 🎉 Gate Square Growth Points Summer Lucky Draw Round 1️⃣ 2️⃣ Is Live!
🎁 Prize pool over $10,000! Win Huawei Mate Tri-fold Phone, F1 Red Bull Racing Car Model, exclusive Gate merch, popular tokens & more!
Try your luck now 👉 https://www.gate.com/activities/pointprize?now_period=12
How to earn Growth Points fast?
1️⃣ Go to [Square], tap the icon next to your avatar to enter [Community Center]
2️⃣ Complete daily tasks like posting, commenting, liking, and chatting to earn points
100% chance to win — prizes guaranteed! Come and draw now!
Event ends: August 9, 16:00 UTC
More details: https://www
Usual and Sherlock launched a bug bounty, offering a reward of 16 million dollars.
According to a report by The Block on April 2, the decentralized stablecoin protocol Usual has partnered with blockchain security firm Sherlock to launch a bug bounty program, offering a reward of $16 million for finding critical vulnerabilities in its codebase. This bounty surpasses the previous amounts set by Uniswap(15.5 million), LayerZero Labs(15 million), and Wormhole(10 million).
The Usual codebase has undergone 20 audits, including the most recent Sherlock audit competition, with no medium or higher-level vulnerabilities found. Only vulnerabilities classified as critical are eligible for the highest rewards. Usual currently manages over $880 million in total locked value (TVL).
Sherlock CEO Jack Sanford stated that this collaboration aims to promote the integrity development of DeFi and enhance trust across the entire ecosystem.