Blockchain Read Receipts Using Cryptographic Puzzle Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing read receipts lack immutability, allowing parties to falsely claim receipt or alteration of messages, especially in legal contexts where proof of message reading is crucial.
Innovation Solution
Implementing a blockchain-based method for read receipts that generates a cryptographic puzzle linked to message opening, ensuring both parties have tamper-proof evidence of message reading without revealing message content.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional read receipts are used, then message reading confirmation can be obtained, but the evidence can be falsified or altered
Solution Approach 1:
The patent introduces a blockchain network as an intermediary between message sender and recipient. The read receipt is not directly exchanged between parties but is instead recorded on the blockchain, which acts as a trusted mediator that prevents falsification while maintaining system simplicity for end users
Solution Approach 2:
The patent creates an immutable copy of the read receipt evidence on the blockchain. Instead of relying on the original message or receipt that could be altered, a cryptographic hash and timestamp are copied to the blockchain, creating an immutable verification record that preserves evidence integrity
2Reliability
If cryptographic puzzles are solved to prove message reading, then tamper-proof evidence is achieved, but computational resources are consumed
Solution Approach 1:
The patent performs preliminary actions by pre-generating cryptographic hashes of the message content and embedding them in the blockchain transaction before the actual reading occurs. When the recipient reads the message, they only need to verify the hash match rather than performing complex cryptographic puzzles, significantly reducing computational energy requirements
Solution Approach 2:
The patent replaces the traditional mechanical approach of solving cryptographic puzzles with a cryptographic verification approach. Instead of requiring computational work to prove reading, the system uses hash verification which is computationally efficient while still providing strong evidence of authenticity
3Stability of the object's composition
If read receipt evidence is stored on blockchain, then immutability is achieved, but data storage capacity is consumed
Solution Approach 1:
The patent extracts only the essential verification elements (cryptographic hash of message content, timestamp, and transaction identifier) and stores them on the blockchain, while the actual message content and full read receipt data remain off-chain. This selective extraction minimizes blockchain data volume while preserving immutability of the critical verification evidence
Solution Approach 2:
The patent moves the heavy data storage to a different dimension - off-chain storage solutions - while keeping only the verification-critical data on the blockchain. This dimensional separation allows the system to achieve immutability for essential evidence without consuming excessive blockchain storage capacity
Data Source
AI summary
A computer-implemented method of requesting a read receipt for a message using a blockchain, the read receipt evidencing that the message has been opened, the method being performed by a first party and comprising: sending the message, and/or an encrypted version thereof, to a second party; generating a cryptographic puzzle based on the message; generating a request blockchain transaction, wherein the request blockchain transaction comprises a first output locked by a first locking script, wherein the first locking script is configured to, when executed together with a first unlocking script of a response blockchain transaction, require the first unlocking script to comprise a solution to the cryptographic puzzle; and determining that the message has been opened in response to determining that the first output has been unlocked.


