Block #531,845

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2014, 6:08:06 PM · Difficulty 10.8954 · 6,278,784 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e23b4580363939fd9b8362b3fadf6c87d21a25e5e0a1e5195eeec614656ac29

Height

#531,845

Difficulty

10.895352

Transactions

6

Size

1.31 KB

Version

2

Bits

0ae535c6

Nonce

54,734,901

Timestamp

5/8/2014, 6:08:06 PM

Confirmations

6,278,784

Merkle Root

43ca8fdb93ecd0c2b9f1b0597f70deb9a98b2b6c7967501c3bc60f39215e3562
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.

6.129 × 10⁹⁸(99-digit number)
61292612684126361147…98532007092615907841
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
6.129 × 10⁹⁸(99-digit number)
61292612684126361147…98532007092615907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.225 × 10⁹⁹(100-digit number)
12258522536825272229…97064014185231815681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.451 × 10⁹⁹(100-digit number)
24517045073650544459…94128028370463631361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.903 × 10⁹⁹(100-digit number)
49034090147301088918…88256056740927262721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.806 × 10⁹⁹(100-digit number)
98068180294602177836…76512113481854525441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.961 × 10¹⁰⁰(101-digit number)
19613636058920435567…53024226963709050881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.922 × 10¹⁰⁰(101-digit number)
39227272117840871134…06048453927418101761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.845 × 10¹⁰⁰(101-digit number)
78454544235681742268…12096907854836203521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.569 × 10¹⁰¹(102-digit number)
15690908847136348453…24193815709672407041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.138 × 10¹⁰¹(102-digit number)
31381817694272696907…48387631419344814081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.276 × 10¹⁰¹(102-digit number)
62763635388545393815…96775262838689628161
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,729,118 XPM·at block #6,810,628 · 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