Quest Love: A First Look at Blockchain Loyalty Programs

• URL: http://arxiv.org/abs/2501.18810v2
• Date: Wed, 19 Mar 2025 13:45:27 GMT
• Title: Quest Love: A First Look at Blockchain Loyalty Programs
• Authors: Joseph Al-Chami, Jeremy Clark,
• Abstract summary: We analyze a quest system that offered 43 unique quests over 10 months with 80M completions.<n>We offer insights about the factors that correlate with task completion.<n>We also discuss the role of farming and bots, and the factors that complicate distinguishing real users from automated scripts.
• Score: 0.15346678870160887
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Blockchain ecosystems -- such as those built around chains, layers, and services -- try to engage users for a variety of reasons: user education, growing and protecting their market share, climbing metric-measuring leaderboards with competing systems, demonstrating usage to investors, and identifying worthy recipients for newly created tokens (airdrops). A popular approach is offering user quests: small tasks that can be completed by a user, exposing them to a common task they might want to do in the future, and rewarding them for completion. In this paper, we analyze a proprietary dataset from one deployed quest system that offered 43 unique quests over 10 months with 80M completions. We offer insights about the factors that correlate with task completion: amount of reward, monetary value of reward, difficulty, and cost. We also discuss the role of farming and bots, and the factors that complicate distinguishing real users from automated scripts.

Related papers

• Process Reinforcement through Implicit Rewards [95.7442934212076]
  Dense process rewards have proven a more effective alternative to the sparse outcome-level rewards in the inference-time scaling of large language models (LLMs) Dense rewards also offer an appealing choice for the reinforcement learning (RL) of LLMs since their fine-grained rewards have the potential to address some inherent issues of outcome rewards. This can be primarily attributed to the challenges of training process reward models (PRMs) online, where collecting high-quality process labels is prohibitively expensive. We propose PRIME, which enables online PRM updates using only policy rollouts and outcome labels through implict process rewards
  arXiv  Detail & Related papers  (2025-02-03T15:43:48Z)
• Next Token Prediction Towards Multimodal Intelligence: A Comprehensive Survey [93.72125112643596]
  Next Token Prediction (NTP) is a versatile training objective for machine learning tasks across various modalities. This survey introduces a comprehensive taxonomy that unifies both understanding and generation within multimodal learning. The proposed taxonomy covers five key aspects: Multimodal tokenization, MMNTP model architectures, unified task representation, datasets & evaluation, and open challenges.
  arXiv  Detail & Related papers  (2024-12-16T05:02:25Z)
• CryptoLLM: Unleashing the Power of Prompted LLMs for SmartQnA and Classification of Crypto Posts [0.0]
  This research aims to enhance the understanding and filtering of cryptocurrency discourse. We have used a prompt-based technique to solve the classification task for reddit posts and twitter posts.
  arXiv  Detail & Related papers  (2024-11-12T16:49:51Z)
• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• Drawing the boundaries between Blockchain and Blockchain-like systems: A Comprehensive Survey on Distributed Ledger Technologies [0.0]
  Bitcoin's global success has led to the rise of blockchain, but many systems labeled as "blockchain" deviate from its core principles. This survey addresses the need for a comprehensive review and taxonomy to clarify the differences between blockchain and blockchain-like systems.
  arXiv  Detail & Related papers  (2024-09-26T09:17:13Z)
• SOK: Blockchain for Provenance [0.0]
  Provenance, which traces data from its creation to manipulation, is crucial for ensuring data integrity, reliability, and trustworthiness. Provenance technology has become a popular choice for implementing provenance due to its distributed, transparent, and immutable nature. Numerous studies on blockchain designs are specifically dedicated to provenance, and specialize in this area.
  arXiv  Detail & Related papers  (2024-07-25T01:46:49Z)
• MEV Ecosystem Evolution From Ethereum 1.0 [6.151915040556504]
  In traditional finance, there are possibilities to create values, e.g., arbitrage offers to create value from market inefficiencies or front-running offers to extract value for the participants having privileged roles. Such opportunities are readily available in DeFi ecosystems, where diverse participants engage in financial activities. In this survey, first, we show how lucrative such opportunities can be. Then, we discuss how protocolfollowing participants trying to capture such opportunities threaten to sabotage blockchain's performance. Finally, we review the current state of research trying to restore trustlessness and decentralization to provide all DeFi participants with a fair marketplace
  arXiv  Detail & Related papers  (2024-06-19T14:22:26Z)
• Studying the association between Gitcoin's issues and resolving outcomes [2.6613573097751866]
  We study over 4,000 issues with Gitcoin bounties using statistical analysis and machine learning techniques. Our study highlights the importance of factors such as the length of the project, issue description, type of bounty issue, and the bounty value, which are found to be highly correlated with the outcome of bounty issues.
  arXiv  Detail & Related papers  (2023-09-26T15:36:55Z)
• Towards Robust Blockchain Price Oracle: A Study on Human-Centric Node Selection Strategy and Incentive Mechanism [6.524599041387636]
  oracle can obtain trusted real-time price information for financial applications such as payment and settlement, and asset valuation on the blockchain. This paper proposes an anonymous node selection scheme that anonymously selects nodes with high reputations to participate in tasks. Under the hypothesis of rational man, an incentive mechanism based on the Stackelberg game is proposed.
  arXiv  Detail & Related papers  (2023-09-09T05:56:29Z)
• Token Spammers, Rug Pulls, and SniperBots: An Analysis of the Ecosystem of Tokens in Ethereum and in the Binance Smart Chain (BNB) [50.888293380932616]
  We study the ecosystem of the tokens and liquidity pools. We find that about 60% of tokens are active for less than one day. We estimate that 1-day rug pulls generated $240 million in profits.
  arXiv  Detail & Related papers  (2022-06-16T14:20:19Z)
• Retrospective on the 2021 BASALT Competition on Learning from Human Feedback [92.37243979045817]
  The goal of the competition was to promote research towards agents that use learning from human feedback (LfHF) techniques to solve open-world tasks. Rather than mandating the use of LfHF techniques, we described four tasks in natural language to be accomplished in the video game Minecraft. Teams developed a diverse range of LfHF algorithms across a variety of possible human feedback types.
  arXiv  Detail & Related papers  (2022-04-14T17:24:54Z)
• The MineRL BASALT Competition on Learning from Human Feedback [58.17897225617566]
  The MineRL BASALT competition aims to spur forward research on this important class of techniques. We design a suite of four tasks in Minecraft for which we expect it will be hard to write down hardcoded reward functions. We provide a dataset of human demonstrations on each of the four tasks, as well as an imitation learning baseline.
  arXiv  Detail & Related papers  (2021-07-05T12:18:17Z)
• Online Learning Demands in Max-min Fairness [91.37280766977923]
  We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof. The mechanism is repeated for multiple rounds and a user's requirements can change on each round. At the end of each round, users provide feedback about the allocation they received, enabling the mechanism to learn user preferences over time.
  arXiv  Detail & Related papers  (2020-12-15T22:15:20Z)
• Investigating the Requirements for Building a Blockchain- Based Achievement Record System [0.0]
  A trusted achievement record is a secure system that aims to record and authenticate certificates as well as key learning activities and achievements. This paper intends to gather information on the thoughts and outlooks of stakeholders on an achievement record system that uses blockchain and smart contract technology.
  arXiv  Detail & Related papers  (2020-07-04T18:44:14Z)
• Mining Implicit Relevance Feedback from User Behavior for Web Question Answering [92.45607094299181]
  We make the first study to explore the correlation between user behavior and passage relevance. Our approach significantly improves the accuracy of passage ranking without extra human labeled data. In practice, this work has proved effective to substantially reduce the human labeling cost for the QA service in a global commercial search engine.
  arXiv  Detail & Related papers  (2020-06-13T07:02:08Z)
• A Proof of Useful Work for Artificial Intelligence on the Blockchain [0.3599866690398789]
  We describe a novel 'proof of useful work' (PoUW) protocol based on training a machine learning model on the blockchain. Miners get a chance to create new coins after performing honest ML training work. We outline mechanisms to reward useful work and punish malicious actors.
  arXiv  Detail & Related papers  (2020-01-25T01:10:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.