Block #569,956

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2014, 12:16:15 PM · Difficulty 10.9647 · 6,257,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c566705a87813da111f03954f8ba2ed0d903330249eabd5c389bd7d2e154aec

Height

#569,956

Difficulty

10.964741

Transactions

4

Size

1.21 KB

Version

2

Bits

0af6f945

Nonce

66,164

Timestamp

5/31/2014, 12:16:15 PM

Confirmations

6,257,251

Merkle Root

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

3.378 × 10⁹⁷(98-digit number)
33787959261584082219…04704151550757109761
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
3.378 × 10⁹⁷(98-digit number)
33787959261584082219…04704151550757109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.757 × 10⁹⁷(98-digit number)
67575918523168164438…09408303101514219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.351 × 10⁹⁸(99-digit number)
13515183704633632887…18816606203028439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.703 × 10⁹⁸(99-digit number)
27030367409267265775…37633212406056878081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.406 × 10⁹⁸(99-digit number)
54060734818534531550…75266424812113756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.081 × 10⁹⁹(100-digit number)
10812146963706906310…50532849624227512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.162 × 10⁹⁹(100-digit number)
21624293927413812620…01065699248455024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.324 × 10⁹⁹(100-digit number)
43248587854827625240…02131398496910049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.649 × 10⁹⁹(100-digit number)
86497175709655250481…04262796993820098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.729 × 10¹⁰⁰(101-digit number)
17299435141931050096…08525593987640197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.459 × 10¹⁰⁰(101-digit number)
34598870283862100192…17051187975280394241
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,861,754 XPM·at block #6,827,206 · 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.
Privacy Policy·

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