Block #501,734

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 11:44:59 PM · Difficulty 10.8044 · 6,311,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27bece88e132a1adb056251871592a3143a77f9667c88e38a070c261e10d27fe

Height

#501,734

Difficulty

10.804439

Transactions

2

Size

427 B

Version

2

Bits

0acdefb0

Nonce

399,755

Timestamp

4/19/2014, 11:44:59 PM

Confirmations

6,311,153

Merkle Root

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

8.867 × 10⁹⁵(96-digit number)
88671182284258009458…66216960636044902401
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
8.867 × 10⁹⁵(96-digit number)
88671182284258009458…66216960636044902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.773 × 10⁹⁶(97-digit number)
17734236456851601891…32433921272089804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.546 × 10⁹⁶(97-digit number)
35468472913703203783…64867842544179609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.093 × 10⁹⁶(97-digit number)
70936945827406407566…29735685088359219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.418 × 10⁹⁷(98-digit number)
14187389165481281513…59471370176718438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.837 × 10⁹⁷(98-digit number)
28374778330962563026…18942740353436876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.674 × 10⁹⁷(98-digit number)
56749556661925126053…37885480706873753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.134 × 10⁹⁸(99-digit number)
11349911332385025210…75770961413747507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.269 × 10⁹⁸(99-digit number)
22699822664770050421…51541922827495014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.539 × 10⁹⁸(99-digit number)
45399645329540100842…03083845654990028801
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,747,126 XPM·at block #6,812,886 · 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