Cryptographic Token Distribution for Provably Fair Online Games

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing online gaming systems face issues with collusion, lack of verifiability, and fairness in token-based games, particularly in token distribution and privacy, due to central server reliance, which can lead to trust concerns among players.

Innovation Solution

A client-server-based system that involves all players in critical steps of token-based games, using cryptographic protocols and commitments to ensure collusion resistance, verifiability, and provable fairness, allowing players to self-enforce integrity and fairness through shared key management and decentralized processes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a central server uses RNG to shuffle and distribute tokens, then the game can be hosted efficiently, but players cannot verify fairness and trust issues arise

Engineering Contradiction:
Improvegame hosting efficiencyVSAvoidfairness verification
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent introduces cryptographic intermediaries (commitment schemes, zero-knowledge proofs, and verifiable random functions) between the server and players. These cryptographic mechanisms act as mediators that allow the server to perform efficient token distribution while enabling players to independently verify fairness without trusting the server's RNG implementation.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces the mechanical/trust-based RNG system with a cryptographic system. Instead of relying on software RNG that players cannot verify, the system uses cryptographic commitments and zero-knowledge proofs to generate and verify random token distribution, substituting unverified mechanical processes with mathematically provable cryptographic mechanisms.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Extent of automation

If the server deals private tokens like hole cards, then dealing is automated, but players cannot be sure their cards are not leaked to opponents

Engineering Contradiction:
Improvedealing automationVSAvoidcard privacy
Core Design Contradiction:
Extent of automationVSReliability

Solution Approach 1:

The patent introduces cryptographic commitment schemes as intermediaries between the dealing process and players. Each player receives a cryptographic commitment to their private tokens that proves the tokens were dealt fairly without revealing them to the server or other players, maintaining privacy while enabling automated dealing.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent creates a cryptographically secure environment where private tokens remain hidden behind cryptographic commitments. This inert cryptographic layer protects private information from being leaked, allowing the server to handle dealing automatically while maintaining the confidentiality of private tokens through mathematical proofs rather than trust.

Inventive Principle:
Principle #39Inert atmosphere (Inert environment)

3Ease of operation

If players connect on a network for online gaming, then accessibility is improved, but collusion becomes harder to detect and easier to execute

Engineering Contradiction:
Improvegame accessibilityVSAvoidcollusion risk
Core Design Contradiction:
Ease of operationVSObject-affected harmful factors

Solution Approach 1:

The patent introduces verifiable random functions and cryptographic proofs as intermediaries that prevent colluding players from coordinating their strategies. Each player receives cryptographically verified random information that cannot be predicted or manipulated, making collusion ineffective even though players can easily connect online.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces trust-based network gaming with cryptography-based verification. Instead of relying on network security or player honesty to prevent collusion, the system uses cryptographic commitments and zero-knowledge proofs to ensure each player receives fair, unpredictable private information that cannot be shared or coordinated among colluding parties.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

4Reliability

If cryptographic protocols are implemented for verifiability, then fairness is improved, but system complexity increases

Engineering Contradiction:
Improvefairness verifiabilityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the cryptographic verification process into distinct, modular components: commitment generation, commitment verification, token distribution, and proof validation. Each component handles a specific aspect of fairness verification, making the overall complex system manageable through clear separation of cryptographic functions.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS11083960B2Cryptographically based system and protocol for provably fair token-based games
Publication Date: 2021.08.10 KUMAR SRIJAN
  • US11083960B2 patent drawing
  • US11083960B2 patent drawing
  • US11083960B2 patent drawing

AI summary

Exemplary embodiments of the present disclosure are directed towards a client server-based system for online token-based games. The system comprises a plurality of game client computing devices configured to play an online token-based game, and a game-based server system comprising central game server configured to connect the players and a protocol manager to provide a plurality of protocols for providing a token based game in a collusion resistant, verifiable and provably fair manner over a network.