Block #501,347

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 5:57:56 PM · Difficulty 10.8029 · 6,325,886 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ea46afa09b74178f809bbed22b82961fef722368e44c7296017cf5e0c9feac2

Height

#501,347

Difficulty

10.802868

Transactions

3

Size

1.47 KB

Version

2

Bits

0acd88ca

Nonce

111,038

Timestamp

4/19/2014, 5:57:56 PM

Confirmations

6,325,886

Merkle Root

3f6680017dfcd7ca29c697b65bb2d139013839bb7b9dd0604469c3abe0f15a71
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.516 × 10⁹⁷(98-digit number)
15169483585550184232…88342677244774758721
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.516 × 10⁹⁷(98-digit number)
15169483585550184232…88342677244774758721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.033 × 10⁹⁷(98-digit number)
30338967171100368465…76685354489549517441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.067 × 10⁹⁷(98-digit number)
60677934342200736930…53370708979099034881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.213 × 10⁹⁸(99-digit number)
12135586868440147386…06741417958198069761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.427 × 10⁹⁸(99-digit number)
24271173736880294772…13482835916396139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.854 × 10⁹⁸(99-digit number)
48542347473760589544…26965671832792279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.708 × 10⁹⁸(99-digit number)
97084694947521179088…53931343665584558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.941 × 10⁹⁹(100-digit number)
19416938989504235817…07862687331169116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.883 × 10⁹⁹(100-digit number)
38833877979008471635…15725374662338232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.766 × 10⁹⁹(100-digit number)
77667755958016943271…31450749324676464641
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,861,964 XPM·at block #6,827,232 · 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