Block #505,610

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/22/2014, 1:37:00 PM · Difficulty 10.8112 · 6,304,458 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1569b43f7abf940a07ee746e6d90308b2b0a65f42b90f346e5cb201993b88ca6

Height

#505,610

Difficulty

10.811232

Transactions

5

Size

1.23 KB

Version

2

Bits

0acface1

Nonce

99,426,184

Timestamp

4/22/2014, 1:37:00 PM

Confirmations

6,304,458

Merkle Root

ef03ef7d17f86e1426cb3d110bb85fee0536ef1e81270e00cfa46d1a5c42708c
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.

4.171 × 10¹⁰⁰(101-digit number)
41717514624355815139…35068185668453437441
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
4.171 × 10¹⁰⁰(101-digit number)
41717514624355815139…35068185668453437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.343 × 10¹⁰⁰(101-digit number)
83435029248711630278…70136371336906874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.668 × 10¹⁰¹(102-digit number)
16687005849742326055…40272742673813749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.337 × 10¹⁰¹(102-digit number)
33374011699484652111…80545485347627499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.674 × 10¹⁰¹(102-digit number)
66748023398969304222…61090970695254999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.334 × 10¹⁰²(103-digit number)
13349604679793860844…22181941390509998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.669 × 10¹⁰²(103-digit number)
26699209359587721689…44363882781019996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.339 × 10¹⁰²(103-digit number)
53398418719175443378…88727765562039992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.067 × 10¹⁰³(104-digit number)
10679683743835088675…77455531124079984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.135 × 10¹⁰³(104-digit number)
21359367487670177351…54911062248159969281
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,724,616 XPM·at block #6,810,067 · 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