From 0392b08d9561f0d5944db01b3502ba0ff34e753d Mon Sep 17 00:00:00 2001 From: Andrea Mazzoleni Date: Tue, 24 Feb 2026 00:01:49 +0100 Subject: [PATCH] Auto update --- beta/howitworks.html | 218 ++++++++++++++++--------------------------- beta/ui.html | 2 +- 2 files changed, 84 insertions(+), 136 deletions(-) diff --git a/beta/howitworks.html b/beta/howitworks.html index 71ce2b04..c4e48dd3 100644 --- a/beta/howitworks.html +++ b/beta/howitworks.html @@ -1,12 +1,10 @@ - - - + + How SnapRAID Works @@ -15,55 +13,51 @@ - - - - + + gtag('config', 'G-W1Z5FKHYQ4'); + - - + (function() { + var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; + ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; + var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); + })(); + -
@@ -79,12 +73,10 @@

Understanding Data Parity

- Parity is a mathematical "summary" of data that allows for the reconstruction of lost information - without requiring a full 1:1 copy of every file. + Parity is a mathematical "summary" of data that allows for the reconstruction of lost information without requiring a full 1:1 copy of every file.

- Traditional mirroring (copying) requires 100% extra space. Parity allows for protection using - significantly less overhead by storing a mathematical relationship between files instead. + Traditional mirroring (copying) requires 100% extra space. Parity allows for protection using significantly less overhead by storing a mathematical relationship between files instead.

@@ -94,11 +86,9 @@

The Basic Logic

"Filling in the Blanks"

Imagine three boxes: two for data (numbers) and one for Parity (the sum of the first two).

- -
-
+ +
+
Disk 1
10
@@ -117,9 +107,8 @@

- If Disk 1 is destroyed, the system solves the remaining equation: - [?] + 15 = 25. + If Disk 1 is destroyed, the system solves the remaining equation: + [?] + 15 = 25. The system identifies the missing value (10) and restores it to a new disk.

@@ -129,48 +118,35 @@

Single Parity

RAID 5 Logic

- The most common form of protection, allowing an array to survive the loss of any - single disk. + The most common form of protection, allowing an array to survive the loss of any single disk.

- Mechanism: It uses the XOR (Exclusive OR) operation. XOR - compares bits across multiple disks to create a "map" that can reverse-engineer any single - missing piece of the puzzle. + Mechanism: It uses the XOR (Exclusive OR) operation. XOR compares bits across multiple disks to create a "map" that can reverse-engineer any single missing piece of the puzzle.

- Limitation: Single parity can only solve for one unknown variable. If two - disks fail simultaneously, the mathematical equation becomes unsolvable (e.g., X + Y = 25 has too many possibilities). + Limitation: Single parity can only solve for one unknown variable. If two disks fail simultaneously, the mathematical equation becomes unsolvable (e.g., X + Y = 25 has too many possibilities).

- -
+ +

Multiple Parity Levels

-

Used to survive multiple simultaneous disk failures by employing more complex mathematical - formulas.

- +

Used to survive multiple simultaneous disk failures by employing more complex mathematical formulas.

+
  • - Dual - Parity (RAID 6) -

    Survives 2 - simultaneous failures.

    -

    Requires two separate - equations: an addition-based sum (XOR) and a polynomial-based formula (Reed-Solomon) - where disks are treated as coordinates on a geometric curve.

    + Dual Parity (RAID 6) +

    Survives 2 simultaneous failures.

    +

    Requires two separate equations: an addition-based sum (XOR) and a polynomial-based formula (Reed-Solomon) where disks are treated as coordinates on a geometric curve.

  • - Triple - to Hexa Parity -

    Survives 3 to 6 - failures.

    -

    Essential for large arrays (20+ - disks) where the statistical risk of multiple failures during a rebuild is higher.

    + Triple to Hexa Parity +

    Survives 3 to 6 failures.

    +

    Essential for large arrays (20+ disks) where the statistical risk of multiple failures during a rebuild is higher.

@@ -180,13 +156,10 @@

The "Largest Disk" Rule

- The Parity Disk must be at least as large as the largest Data Disk in the - array. + The Parity Disk must be at least as large as the largest Data Disk in the array.

- Reason: Parity is calculated on a "sector-by-sector" basis. To protect the - 1,000th gigabyte of a data drive, the parity drive must have a 1,000th gigabyte available to - store that specific calculation. Without that space, the data is left unprotected. + Reason: Parity is calculated on a "sector-by-sector" basis. To protect the 1,000th gigabyte of a data drive, the parity drive must have a 1,000th gigabyte available to store that specific calculation. Without that space, the data is left unprotected.

@@ -196,37 +169,31 @@

The Role of Integrity Checksums in Data Repair

- +

The "Silent Error" Problem

- Physical disk failure is obvious: the drive disappears. However, "Silent Corruption" (bit-rot) is - invisible. + Physical disk failure is obvious: the drive disappears. However, "Silent Corruption" (bit-rot) is invisible. A single bit flips from a 0 to a 1, but the disk still appears "healthy" to the computer.

- +

Why Parity Alone is Not Enough

"Parity can fix a hole, but it cannot find a lie."

- +

Recall our simple math: Disk A (5) + Disk B (3) = Parity (8).

- -
-

Scenario: Bit-Rot on - Disk A

+ +
+

Scenario: Bit-Rot on Disk A

Original: 5 + 3 = 8 ✓
-
Rotten:  9 + 3 = 12 ✗
-
+
Rotten:  9 + 3 = 12 ✗
+
Mismatch! 12 ≠ 8 (Parity)
@@ -246,8 +213,7 @@

- Without knowing the culprit, parity is useless. If you try to "fix" the array blindly, you might - overwrite good data with bad data. + Without knowing the culprit, parity is useless. If you try to "fix" the array blindly, you might overwrite good data with bad data.

@@ -255,71 +221,52 @@

The Solution: Integrity Checksums

"Digital Fingerprints"

- +

A checksum is a mathematical fingerprint for a specific file or block of data.

- +
-

The Repair - Workflow

- +

The Repair Workflow

+
-
-
- 1
+
+
1
-
Check Fingerprint A -
-
"Does not match." (Culprit - Found!)
+
Check Fingerprint A
+
"Does not match." (Culprit Found!)
-
-
- 2
+
+
2
-
Check Fingerprint B -
-
"Matches." (Data is safe.) -
+
Check Fingerprint B
+
"Matches." (Data is safe.)
-
-
- 3
+
+
3
Check Parity
-
"Matches." (Parity is safe.) -
+
"Matches." (Parity is safe.)

- Result: We know with 100% certainty that Disk A is the liar. - We can now safely use the math (Parity 8 - Disk B 3) to recalculate the original - 5 and repair the corruption. + Result: We know with 100% certainty that Disk A is the liar. We can now safely use the math (Parity 8 - Disk B 3) to recalculate the original 5 and repair the corruption.

-
+

- "Integrity checksums provide the Identity of the error, while Parity provides the - Medicine. You need both to perform a successful surgery on your data." + "Integrity checksums provide the Identity of the error, while Parity provides the Medicine. You need both to perform a successful surgery on your data."

@@ -344,5 +291,6 @@
+ + - \ No newline at end of file diff --git a/beta/ui.html b/beta/ui.html index a1af341f..bb4b55cd 100644 --- a/beta/ui.html +++ b/beta/ui.html @@ -85,7 +85,7 @@

Move your management from the terminal to the browser. The integrated Web UI provides a high-fidelity command center that is served natively by the daemon, no complex web server setup required.

-
+
Daemon Dashboard
Daemon Dashboard