Broadcast Data Slice Encoding for Memory Error Recovery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data storage and processing systems face challenges in efficiently and securely storing and retrieving large volumes of data across distributed networks while maintaining data integrity and resilience against failures, without the need for redundant copies.

Innovation Solution

A distributed computing system that employs dispersed storage and task processing, utilizing dispersed storage error encoding and decoding, along with distributed task processing units to manage and execute tasks on data across geographically diverse locations, ensuring data integrity and resilience against failures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored in a distributed network across multiple locations, then data availability and resilience against failures are improved, but data integrity and security become more difficult to maintain

Engineering Contradiction:
Improveresilience against failuresVSAvoiddata integrity maintenance
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments data into multiple slices and disperses them across different storage units in a distributed network. Each slice is encoded with error correction codes, allowing the system to maintain data integrity even when some slices are corrupted or lost. This segmentation approach resolves the contradiction by enabling resilience through distribution while maintaining integrity through localized error correction on each slice.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary encoding layer that processes data before distribution. Error correction codes and cryptographic hashing are applied as intermediary mechanisms to ensure that distributed data slices can be verified and reconstructed accurately. This intermediary processing resolves the contradiction by providing automated integrity verification without requiring complex manual management of distributed data.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If redundant copies of data are stored, then data recovery after failures is improved, but storage efficiency and cost are worsened

Engineering Contradiction:
Improvedata recovery capabilityVSAvoidstorage capacity utilization
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent uses error correction coding to create redundant information in an efficient manner. Instead of storing complete duplicate copies of data, the system encodes data slices with error correction codes that allow reconstruction of original data from fewer than all slices. This resolves the contradiction by providing data recovery capability while using storage capacity more efficiently than traditional redundancy methods.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The patent changes the parameter of data representation by applying cryptographic hashing and error correction encoding. These parameter transformations enable the system to verify data integrity and recover from failures without storing additional full copies of the original data. The encoded slices contain sufficient information for recovery while occupying less total storage space than redundant copies would require.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If data is encoded and dispersed across multiple storage units, then security and resilience are improved, but data access speed and retrieval efficiency are worsened

Engineering Contradiction:
Improvedata securityVSAvoiddata retrieval speed
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent segments data into slices that are distributed across multiple storage units, but implements parallel retrieval mechanisms where multiple slices can be fetched simultaneously. The system reconstructs original data by combining retrieved slices, enabling secure dispersed storage while maintaining access speed through parallel processing. This resolves the contradiction by allowing security through segmentation while preserving speed through concurrent operations.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a threshold mechanism where data can be reconstructed from a subset of slices rather than requiring all slices. This partial action approach allows the system to retrieve data from fewer storage units than the total number of dispersed slices, improving access speed while maintaining security. The system performs excessive encoding (more slices than minimum needed) to enable this efficient partial retrieval capability.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS20260064267A1Encoding Broadcast Data in a Vast Storage Network
Publication Date: 2026.03.05 PURE STORAGE INC
  • US20260064267A1 patent drawing
  • US20260064267A1 patent drawing
  • US20260064267A1 patent drawing

AI summary

A method includes detecting a memory error associated with a memory device of a storage unit of a set of storage units that is storing a set of encoded data slices, the storage unit services encoded data slice access messages from a processing unit, and the detecting occurs while attempting to access one or more of: a read threshold number (R) of encoded data slices, a decode threshold number (D) of encoded data slices needed to reconstruct the data segment, or a write threshold number (W) indicating a number of encoded data slices that must be accurately stored. The method further includes identifying an error descriptor code based on the detected memory error. The method further includes determining to perform an action based on the error descriptor code and executing the action to produce an action result.