Block #500,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 6:50:41 AM · Difficulty 10.8013 · 6,308,676 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3a24a25bfe08bfb0db5a6253f896f529a2148a83b344d764f8ec72484f65ff1

Height

#500,642

Difficulty

10.801258

Transactions

9

Size

2.40 KB

Version

2

Bits

0acd1f39

Nonce

1,750

Timestamp

4/19/2014, 6:50:41 AM

Confirmations

6,308,676

Merkle Root

73235b759c44d17666df85f28d4f948cb89232728ab99dcd4b5a86d158fe5631
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.178 × 10¹⁰⁵(106-digit number)
31789863385691616066…27852134583604838401
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.178 × 10¹⁰⁵(106-digit number)
31789863385691616066…27852134583604838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.357 × 10¹⁰⁵(106-digit number)
63579726771383232132…55704269167209676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.271 × 10¹⁰⁶(107-digit number)
12715945354276646426…11408538334419353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.543 × 10¹⁰⁶(107-digit number)
25431890708553292852…22817076668838707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.086 × 10¹⁰⁶(107-digit number)
50863781417106585705…45634153337677414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.017 × 10¹⁰⁷(108-digit number)
10172756283421317141…91268306675354828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.034 × 10¹⁰⁷(108-digit number)
20345512566842634282…82536613350709657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.069 × 10¹⁰⁷(108-digit number)
40691025133685268564…65073226701419315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.138 × 10¹⁰⁷(108-digit number)
81382050267370537129…30146453402838630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.627 × 10¹⁰⁸(109-digit number)
16276410053474107425…60292906805677260801
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,718,610 XPM·at block #6,809,317 · 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