Reddit records highest NFT trading volume
Reddit NFT trading volume hits all-time high as wallet holders near 3 million. Meanwhile, the minting volume of non-fungible tokens have been declining steadily.
According to data provided by Polygon and Dune Analytics, the trading volume of Reddit non-fungible token (NFT) avatars has eclipsed $1.5 million in the past 24 hours. The increase represents over one-third of the collection’s cumulative trading volume of $4.1 million since launch. At the same time, the daily sales volume of Reddit NFTs also saw a new all-time high of 3,780 digital collectibles changing hands.
Reddit avatars are created by independent artists and are minted as NFTs on the Polygon blockchain. Users can purchase such collectibles on Vault, Reddit’s cryptocurrency wallet. They can then be worn and displayed as profile pictures when users create content on the popular social media platform.
After being purchased, the NFTs can be bought and sold on secondary markets such as OpenSea etc. While some collections witness little to no bids, others have floor prices above $2,000. The highest price for a Reddit NFT current stands at $24,149, or 18 Ether.
Reddit NFT wallet holders near 3 million
Since their launch in July 2022, more than 2.9 million collectible avatars have been minted. Correspondingly, the total number of wallets holding Reddit NFTs is currently at 2.8 million. However, the collection’s supply has not surged in proportion, with only around a few thousand NFTs minted per day compared with the record daily rate of around 200,000 NFTs minted in late August.
Reddit originally designed the venture as a means of empowering artists to create NFT artwork and monetize their collectibles on NFT marketplaces. Thus far, data show that artists have earned more than $60,000 in royalties from secondary market sales of the NFTs.
Quantum Cybersecurity: The KXCO Chain Is Already Running
The World Economic Forum warned on 11 September that the quantum-safe race has changed gears. It is right about the direction and late about the work. Every KXCO product already runs on NIST's post-quantum algorithms, and all of them run on the same implementation: 42 package manifests declare one library. The chain verifies ML-DSA-65 on-chain at precompile 0x0b, tested live with three negative controls. NIST's own grader marked the library at 2,130 cases and zero failures.
NIST Graded Our Post-Quantum Cryptography. Zero Failures.
NIST's Algorithm Validation Test System generated test vectors nobody had seen, we answered them over the ACVP protocol, and NIST graded the result: 2,130 cases across ML-KEM, ML-DSA and SLH-DSA in every parameter set offered, zero failures, demo certificate A11025. This is what that proves, where we deliberately drew the claim narrower than NIST's own matrix, and why the FIPS 140-2 sunset on 21 September makes the distinction between being graded and grading yourself worth understanding.
What KXCO Is, and Why the Hard Problem Was Never Intelligence
The prevailing enthusiasm assumes the hard problem is intelligence. It is not. It is that banks, hospitals, courts and governments are being asked to let software act on their behalf with no way to establish who decided, on what basis, or whether the record will still read in a decade. KXCO founder Shayne Heffernan sets out the architecture that answers those questions, drawn as a graph, and argues that properly constructed AI is an amplifier of human judgement rather than a replacement for it.
AI Intelligence Scales. Accountability Does Not. Why KXCO Is Built for It.
Capability is becoming abundant and everything abundant gets cheap. What does not get cheap is the person who has to sign, and they can only carry what they can see. Four conditions follow from that, and four independent authorities reached the first of them last month without knowing it.
Every story, signed and delivered.
Subscribe to the kxco channel and get the headline, the AI-written key takeaways, and the chain-anchor link the moment we publish. Audio versions and per-ticker subscriptions arrive in the next iteration.