Block #565,148

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2014, 3:44:29 AM · Difficulty 10.9648 · 6,245,673 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0b0cc4840dba9d4ecb598964dda276c324e6c2f74c4bb8ce4de4b3f4ce0cd033

Height

#565,148

Difficulty

10.964752

Transactions

13

Size

3.14 KB

Version

2

Bits

0af6fa02

Nonce

461,367,210

Timestamp

5/28/2014, 3:44:29 AM

Confirmations

6,245,673

Merkle Root

0b4292079f1181f73d4a1d3dfe4668b4ab71bfb08c10b64c21d3060a4b06e7e8
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.

2.164 × 10⁹⁸(99-digit number)
21649190561927251054…81104512918526524001
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
2.164 × 10⁹⁸(99-digit number)
21649190561927251054…81104512918526524001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.329 × 10⁹⁸(99-digit number)
43298381123854502108…62209025837053048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.659 × 10⁹⁸(99-digit number)
86596762247709004216…24418051674106096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.731 × 10⁹⁹(100-digit number)
17319352449541800843…48836103348212192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.463 × 10⁹⁹(100-digit number)
34638704899083601686…97672206696424384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.927 × 10⁹⁹(100-digit number)
69277409798167203373…95344413392848768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.385 × 10¹⁰⁰(101-digit number)
13855481959633440674…90688826785697536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.771 × 10¹⁰⁰(101-digit number)
27710963919266881349…81377653571395072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.542 × 10¹⁰⁰(101-digit number)
55421927838533762698…62755307142790144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.108 × 10¹⁰¹(102-digit number)
11084385567706752539…25510614285580288001
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,730,670 XPM·at block #6,810,820 · 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