Block #523,655

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2014, 5:38:44 PM · Difficulty 10.8729 · 6,307,199 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79ab7b96581a3813dd9b4e54da860f5d4477f957a6127884da702e5fa7feef18

Height

#523,655

Difficulty

10.872943

Transactions

6

Size

1.71 KB

Version

2

Bits

0adf7932

Nonce

6,919

Timestamp

5/3/2014, 5:38:44 PM

Confirmations

6,307,199

Merkle Root

a93b5c68ead87ceb99d9f567f3c17fc16bf1025bd0d7eaadbc9b4253e5f93ff0
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.822 × 10¹⁰⁹(110-digit number)
18225227516148769504…87364390720739737601
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.822 × 10¹⁰⁹(110-digit number)
18225227516148769504…87364390720739737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.645 × 10¹⁰⁹(110-digit number)
36450455032297539008…74728781441479475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.290 × 10¹⁰⁹(110-digit number)
72900910064595078017…49457562882958950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.458 × 10¹¹⁰(111-digit number)
14580182012919015603…98915125765917900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.916 × 10¹¹⁰(111-digit number)
29160364025838031207…97830251531835801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.832 × 10¹¹⁰(111-digit number)
58320728051676062414…95660503063671603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.166 × 10¹¹¹(112-digit number)
11664145610335212482…91321006127343206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.332 × 10¹¹¹(112-digit number)
23328291220670424965…82642012254686412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.665 × 10¹¹¹(112-digit number)
46656582441340849931…65284024509372825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.331 × 10¹¹¹(112-digit number)
93313164882681699862…30568049018745651201
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,890,968 XPM·at block #6,830,853 · 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