Block #569,334

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2014, 2:19:41 AM · Difficulty 10.9646 · 6,243,534 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb143978717d6dfad586a23e5b88cef62c6451a4cc3d8b5d18e4e69e1c2bb247

Height

#569,334

Difficulty

10.964557

Transactions

9

Size

2.11 KB

Version

2

Bits

0af6ed39

Nonce

542,166,057

Timestamp

5/31/2014, 2:19:41 AM

Confirmations

6,243,534

Merkle Root

ddeb68dd8865abe5ae60ef7f1c4f2c2557041f8a8c3a408f6b696aeeff99288d
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.

5.611 × 10⁹⁷(98-digit number)
56114283944284765190…43347875604065077841
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
5.611 × 10⁹⁷(98-digit number)
56114283944284765190…43347875604065077841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.122 × 10⁹⁸(99-digit number)
11222856788856953038…86695751208130155681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.244 × 10⁹⁸(99-digit number)
22445713577713906076…73391502416260311361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.489 × 10⁹⁸(99-digit number)
44891427155427812152…46783004832520622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.978 × 10⁹⁸(99-digit number)
89782854310855624304…93566009665041245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.795 × 10⁹⁹(100-digit number)
17956570862171124860…87132019330082490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.591 × 10⁹⁹(100-digit number)
35913141724342249721…74264038660164981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.182 × 10⁹⁹(100-digit number)
71826283448684499443…48528077320329963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.436 × 10¹⁰⁰(101-digit number)
14365256689736899888…97056154640659927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.873 × 10¹⁰⁰(101-digit number)
28730513379473799777…94112309281319854081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,746,974 XPM·at block #6,812,867 · 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