Block #532,788

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 7:24:25 AM · Difficulty 10.8984 · 6,277,304 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
fb0d20e927ce2cda15ecf5eea4ed73e3917557c0ef1fcc4368abbf29992e83e7

Height

#532,788

Difficulty

10.898395

Transactions

6

Size

2.61 KB

Version

2

Bits

0ae5fd3e

Nonce

17,030,372

Timestamp

5/9/2014, 7:24:25 AM

Confirmations

6,277,304

Merkle Root

094f5db6612349370260ff246e5cf1d7058e45c85873e4556721991fec30e0d9
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.189 × 10¹⁰¹(102-digit number)
11897675262736612580…44784158287437312001
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
1.189 × 10¹⁰¹(102-digit number)
11897675262736612580…44784158287437312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.379 × 10¹⁰¹(102-digit number)
23795350525473225161…89568316574874624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.759 × 10¹⁰¹(102-digit number)
47590701050946450323…79136633149749248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.518 × 10¹⁰¹(102-digit number)
95181402101892900646…58273266299498496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.903 × 10¹⁰²(103-digit number)
19036280420378580129…16546532598996992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.807 × 10¹⁰²(103-digit number)
38072560840757160258…33093065197993984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.614 × 10¹⁰²(103-digit number)
76145121681514320517…66186130395987968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.522 × 10¹⁰³(104-digit number)
15229024336302864103…32372260791975936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.045 × 10¹⁰³(104-digit number)
30458048672605728206…64744521583951872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.091 × 10¹⁰³(104-digit number)
60916097345211456413…29489043167903744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.218 × 10¹⁰⁴(105-digit number)
12183219469042291282…58978086335807488001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,724,810 XPM·at block #6,810,091 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy