Block #508,477

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2014, 10:17:02 AM · Difficulty 10.8183 · 6,308,484 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12e568030640169d092f1c3f4d6abfd55871b959805778c4dcc54d8e63e4d13b

Height

#508,477

Difficulty

10.818293

Transactions

10

Size

2.66 KB

Version

2

Bits

0ad17ba3

Nonce

1,753

Timestamp

4/24/2014, 10:17:02 AM

Confirmations

6,308,484

Merkle Root

5106433f388bb55b1a06b3a0bea220f64b165a617add2de07aee0717abd2b88d
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.

7.097 × 10⁹⁵(96-digit number)
70974592505027950012…43630647160064678561
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
7.097 × 10⁹⁵(96-digit number)
70974592505027950012…43630647160064678561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.419 × 10⁹⁶(97-digit number)
14194918501005590002…87261294320129357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.838 × 10⁹⁶(97-digit number)
28389837002011180005…74522588640258714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.677 × 10⁹⁶(97-digit number)
56779674004022360010…49045177280517428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.135 × 10⁹⁷(98-digit number)
11355934800804472002…98090354561034856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.271 × 10⁹⁷(98-digit number)
22711869601608944004…96180709122069713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.542 × 10⁹⁷(98-digit number)
45423739203217888008…92361418244139427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.084 × 10⁹⁷(98-digit number)
90847478406435776016…84722836488278855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.816 × 10⁹⁸(99-digit number)
18169495681287155203…69445672976557711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.633 × 10⁹⁸(99-digit number)
36338991362574310406…38891345953115422721
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,779,724 XPM·at block #6,816,960 · 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