Block #564,545

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2014, 5:53:03 PM · Difficulty 10.9646 · 6,242,016 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
59ec349a945d1cfc2c877f46a34f8a26900ad71e79637ffcd1eb51a43753deae

Height

#564,545

Difficulty

10.964638

Transactions

2

Size

434 B

Version

2

Bits

0af6f28c

Nonce

1,215,103,156

Timestamp

5/27/2014, 5:53:03 PM

Confirmations

6,242,016

Merkle Root

b164c253b122f3a525abdf6b62144476dc7022d68e08d024dff87621341fa2dc
Transactions (2)
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.824 × 10¹⁰⁰(101-digit number)
18244148969384974480…53976133908372951041
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.824 × 10¹⁰⁰(101-digit number)
18244148969384974480…53976133908372951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.648 × 10¹⁰⁰(101-digit number)
36488297938769948961…07952267816745902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.297 × 10¹⁰⁰(101-digit number)
72976595877539897922…15904535633491804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.459 × 10¹⁰¹(102-digit number)
14595319175507979584…31809071266983608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.919 × 10¹⁰¹(102-digit number)
29190638351015959168…63618142533967216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.838 × 10¹⁰¹(102-digit number)
58381276702031918337…27236285067934433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.167 × 10¹⁰²(103-digit number)
11676255340406383667…54472570135868866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.335 × 10¹⁰²(103-digit number)
23352510680812767335…08945140271737733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.670 × 10¹⁰²(103-digit number)
46705021361625534670…17890280543475466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.341 × 10¹⁰²(103-digit number)
93410042723251069340…35780561086950932481
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,696,584 XPM·at block #6,806,560 · 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