Tootfinder

Opt-in global Mastodon full text search. Join the index!

@rasterweb@mastodon.social
2026-07-01 17:41:09

Some dude wants to "buy" my Instagram account username because he has a business involving "artists" and NFTs and crypto and blockchains and admits 99% of NFTs are "shit" and like, no... no my dude. No.

@adamhotep@infosec.exchange
2026-08-06 18:21:48

Screw NFTs & blockchains; @… has developed a system that shares hashes (not content) on federated media that will allow you to cryptographically prove your photo is unchanged since a specific date:
nerds.xyz/2026/08/veridenz-ver

@arXiv_csCR_bot@mastoxiv.page
2026-07-24 08:07:53

Themis Consensus Extension v1: MEV Mitigation by Randomized Delayed Execution and Intent-Hiding Transactions in Application-Specific Blockchains
Shoeb Siddiqui, Mateusz Nowakowski, Stanislav Vozarik, Gleb Urvanov, Peter Kris
arxiv.org/abs/2607.21406 arxiv.org/pdf/2607.21406 arxiv.org/html/2607.21406
arXiv:2607.21406v1 Announce Type: new
Abstract: Maximal extractable value (MEV) arises when privileged participants select, exclude, insert, or reorder pending transactions for private gain. We specify and analyze the Themis Consensus Extension v1, first published by Mangata in 2021. The design separates value extraction by reordering (VER) from value extraction by denial (VED). For VER, block construction and execution occur across consecutive producers: one producer commits a transaction set, and the next derives a publicly verifiable, deterministic, previously un- predictable seed and executes a seed-determined, dependency-preserving permutation. For selective VED, a user may encrypt a transaction for a designated builder and executor. The builder removes an outer layer and commits the opaque inner ciphertext; the executor reveals and executes the plaintext only after commitment. Under selfish but non-colluding validators, an adversary below the underlying consensus fault threshold, secure cryptography, and accountable role performance, the construction limits unilateral post-commit ordering control and hides transaction intent from relays and the builder. It does not provide send-order or receive-order fairness, complete censorship resistance, resistance to builder-executor collusion, or per-transaction price guarantees. We analyze probabilistic extraction, spam, dependent transactions, decryption liveness, session boundaries, total denial, and threshold coalitions. We also document the initial Aura-based Substrate implementation and its subsequent transition to a BABE-based sr25519/VRF seed path, together with delayed execution, Fisher-Yates shuffling, and Xoshiro256 . The result preserves the original proposal while narrowing its claims to explicit assumptions.
toXiv_bot_toot

@arXiv_csIT_bot@mastoxiv.page
2026-06-11 08:53:24

Replaced article(s) found for cs.IT. arxiv.org/list/cs.IT/new
[1/1]:
- Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal
arxiv.org/abs/2601.10047 mastoxiv.page/@arXiv_csIT_bot/
- Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization
Xiang Zhang, Giuseppe Caire, Mingyue Ji
arxiv.org/abs/2602.12220 mastoxiv.page/@arXiv_csIT_bot/
- A New Approach to Code Smoothing Bounds
Tsuyoshi Miezaki, Yusaku Nishimura, Katsuyuki Takashima
arxiv.org/abs/2603.18077 mastoxiv.page/@arXiv_csIT_bot/
- Fluid Antenna Systems Enabling 6G HRLLC With Port Switching Delay
Xusheng Zhu, Kai-Kit Wong, Hao Xu, Chenguang Rao, Hyundong Shin
arxiv.org/abs/2605.06275 mastoxiv.page/@arXiv_csIT_bot/
- Accurate Estimation of Mutual Information in High Dimensional Data
Eslam Abdelaleem, K. Michael Martini, Ilya Nemenman
arxiv.org/abs/2506.00330 mastoxiv.page/@arXiv_physicsda
- SDQM: Synthetic Data Quality Metric for Object Detection Dataset Evaluation
Ayush Zenith, Arnold Zumbrun, Neel Raut, Jing Lin
arxiv.org/abs/2510.06596 mastoxiv.page/@arXiv_csCV_bot/
- SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Use...
Weihang Cao, Mustafa Doger, Sennur Ulukus
arxiv.org/abs/2512.13666 mastoxiv.page/@arXiv_csCR_bot/
- A theory of learning data statistics in diffusion models, from easy to hard
Lorenzo Bardone, Claudia Merger, Sebastian Goldt
arxiv.org/abs/2603.12901 mastoxiv.page/@arXiv_statML_bo
- On the independence number of de Bruijn graphs
Pietro Majer, Matteo Novaga
arxiv.org/abs/2604.14671 mastoxiv.page/@arXiv_mathCO_bo
- Information bottleneck for learning the phase space of dynamics from high-dimensional experimenta...
K. Michael Martini, Eslam Abdelaleem, Paarth Gulati, Ilya Nemenman
arxiv.org/abs/2604.24662 mastoxiv.page/@arXiv_physicsda
- Improved Amenability Bounds for Local Coordination Games
Ron Peretz, Dean Kraizberg
arxiv.org/abs/2606.01963 mastoxiv.page/@arXiv_csGT_bot/
toXiv_bot_toot