Block #472,418

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2014, 6:49:20 AM · Difficulty 10.4335 · 6,344,856 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae134b35f81f711c2ca770f697a74a9f39592ea1f68a1556a9529de7daecd82b

Height

#472,418

Difficulty

10.433494

Transactions

4

Size

879 B

Version

2

Bits

0a6ef97c

Nonce

34,591

Timestamp

4/3/2014, 6:49:20 AM

Confirmations

6,344,856

Merkle Root

9554b125f0c7ba8d4703f40413524c1ccbae72f74a539cffbbed145fa3cfb307
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.610 × 10⁹⁶(97-digit number)
16105827583324421132…83354665983051716921
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.610 × 10⁹⁶(97-digit number)
16105827583324421132…83354665983051716921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.221 × 10⁹⁶(97-digit number)
32211655166648842265…66709331966103433841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.442 × 10⁹⁶(97-digit number)
64423310333297684531…33418663932206867681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.288 × 10⁹⁷(98-digit number)
12884662066659536906…66837327864413735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.576 × 10⁹⁷(98-digit number)
25769324133319073812…33674655728827470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.153 × 10⁹⁷(98-digit number)
51538648266638147624…67349311457654941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.030 × 10⁹⁸(99-digit number)
10307729653327629524…34698622915309882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.061 × 10⁹⁸(99-digit number)
20615459306655259049…69397245830619765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.123 × 10⁹⁸(99-digit number)
41230918613310518099…38794491661239531521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.246 × 10⁹⁸(99-digit number)
82461837226621036199…77588983322479063041
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,782,230 XPM·at block #6,817,273 · 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