Hash-Chained Product Identifier Logging for Tamper-Proof Traceability

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods struggle to efficiently implement the unique identification and traceability requirements for products, particularly tobacco packaging, ensuring tamper-proof logging and compliance with legal regulations such as Directive 2014/40/EU and Commission Implementing Regulation of 15 December 2017, while being versatile for other applications.

Innovation Solution

A method involving the iterative application of cryptographic hash functions to alphanumeric sequences of product identifiers, combined with timestamping, ensures tamper-proof logging by generating and storing hash values, which can be physically or electronically stored, allowing for flexible and compliant tracking of product batches.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If cryptographic hash functions are applied iteratively to each identifier with previous hash values, then tamper-proof logging and traceability are ensured, but the processing time and computational complexity increase

Engineering Contradiction:
Improvetamper-proof loggingVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary hashing of identifier sequences during the logging process itself, rather than requiring separate verification operations later. By computing hash values iteratively as each identifier is logged and storing them in the chain structure, the system prepares verification data in advance, eliminating the need for time-consuming re-computation during audits or traceability checks.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Instead of storing and verifying the original identifier sequences repeatedly, the system creates hash value copies that serve as verification tokens. These hash copies are stored in the chain structure and can be quickly compared against newly generated hashes to verify integrity, replacing time-consuming original data verification with fast hash comparison operations.

Inventive Principle:
Principle #26Copying

2Loss of information

If all hash values are stored permanently for complete traceability, then full traceability is achieved, but storage requirements and data management complexity increase

Engineering Contradiction:
Improvetraceability informationVSAvoidstorage requirements
Core Design Contradiction:
Loss of informationVSQuantity of substance

Solution Approach 1:

The logging system divides the traceability data into discrete hash chain segments, where each segment represents a batch or period of logged identifiers. The chain structure naturally segments data into manageable units that can be stored, archived, or deleted independently, allowing the system to maintain complete traceability within each segment while reducing overall storage requirements through selective segment management.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system implements a hash chain structure where older hash values can be discarded after serving their traceability purpose, while the ability to recover traceability information is maintained through the cryptographic chain structure. By storing only the essential hash chain links rather than complete identifier histories, the system enables traceability recovery when needed while minimizing permanent storage requirements.

Inventive Principle:
Principle #34Discarding and recovering

Data Source

PatentEP3608862B1Method for logging recognition features for products
Publication Date: 2025.12.10 BUNDESDRUCKEREI GMBH
  • EP3608862B1 patent drawingFigure 1~3

AI summary

A method for logging a number of identifiers is described, where each identifier comprises a sequence of alphanumeric characters.The procedure comprises the following steps: a) reading (1) the sequence of alphanumeric characters of a first identifier E1, b) generating a first hash value H1 (2) by applying a hash function to a first sequence N1 of alphanumeric characters, which includes the sequence of alphanumeric characters of the read first identifier E1 and a time value Z, c) storing (3) the first hash value H1 using a storage device, d) reading (4) a subsequent identifier En, e) generating a hash value Hn (5) by applying a hash function to a sequence Nn of alphanumeric characters, which includes the sequence of alphanumeric characters of the read identifier En or a hash value derived from this sequence and the previously generated hash value Hn-1, f) storing (6) the hash value Hn using a storage device, iteratively continuing steps d) to f).