Block #417,348

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2014, 3:04:06 AM · Difficulty 10.3890 · 6,391,521 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d2ba336672cc7bee4ed6ab23f7b8f689aee2b18c654c3dac70fecfd5182e20fc

Height

#417,348

Difficulty

10.389033

Transactions

7

Size

1.82 KB

Version

2

Bits

0a6397a4

Nonce

2,168

Timestamp

2/24/2014, 3:04:06 AM

Confirmations

6,391,521

Merkle Root

4d405ef854c8e3dc1a9fa9797e9262bcbca9510e5d9a252f902a1c18759e63ca
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.

2.610 × 10⁹⁸(99-digit number)
26104040381521162947…60704478487471455959
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
2.610 × 10⁹⁸(99-digit number)
26104040381521162947…60704478487471455959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.220 × 10⁹⁸(99-digit number)
52208080763042325895…21408956974942911919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.044 × 10⁹⁹(100-digit number)
10441616152608465179…42817913949885823839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.088 × 10⁹⁹(100-digit number)
20883232305216930358…85635827899771647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.176 × 10⁹⁹(100-digit number)
41766464610433860716…71271655799543295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.353 × 10⁹⁹(100-digit number)
83532929220867721432…42543311599086590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.670 × 10¹⁰⁰(101-digit number)
16706585844173544286…85086623198173181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.341 × 10¹⁰⁰(101-digit number)
33413171688347088572…70173246396346362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.682 × 10¹⁰⁰(101-digit number)
66826343376694177145…40346492792692725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.336 × 10¹⁰¹(102-digit number)
13365268675338835429…80692985585385451519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,715,002 XPM·at block #6,808,868 · 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