Block #565,837

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2014, 1:14:49 PM · Difficulty 10.9656 · 6,259,877 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f164f0fc0d011236d303e73c59d4172b4c2f7d782d77553567d2048c6e24b0c

Height

#565,837

Difficulty

10.965604

Transactions

3

Size

1.07 KB

Version

2

Bits

0af731cd

Nonce

200,655

Timestamp

5/28/2014, 1:14:49 PM

Confirmations

6,259,877

Merkle Root

b8b3e58fbf257bca88cc812bb014b4e89b6a46a83c42f2956f8f033cdcd7650d
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.552 × 10¹⁰²(103-digit number)
15526765399191847765…73907432635083429301
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.552 × 10¹⁰²(103-digit number)
15526765399191847765…73907432635083429301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.105 × 10¹⁰²(103-digit number)
31053530798383695530…47814865270166858601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.210 × 10¹⁰²(103-digit number)
62107061596767391061…95629730540333717201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.242 × 10¹⁰³(104-digit number)
12421412319353478212…91259461080667434401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.484 × 10¹⁰³(104-digit number)
24842824638706956424…82518922161334868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.968 × 10¹⁰³(104-digit number)
49685649277413912849…65037844322669737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.937 × 10¹⁰³(104-digit number)
99371298554827825698…30075688645339475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.987 × 10¹⁰⁴(105-digit number)
19874259710965565139…60151377290678950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.974 × 10¹⁰⁴(105-digit number)
39748519421931130279…20302754581357900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.949 × 10¹⁰⁴(105-digit number)
79497038843862260558…40605509162715801601
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,849,817 XPM·at block #6,825,713 · 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