Block #401,525

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 7:50:43 PM · Difficulty 10.4350 · 6,407,201 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37f4eac7d17ad80998154ee186de601d0fd307e438904e374aec80df6a63c944

Height

#401,525

Difficulty

10.435032

Transactions

2

Size

872 B

Version

2

Bits

0a6f5e42

Nonce

88,015

Timestamp

2/12/2014, 7:50:43 PM

Confirmations

6,407,201

Merkle Root

8e5be8df3dbb847400c2483095d1c34f239bfdae7df5ad517405d1686735105f
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.

2.641 × 10¹⁰¹(102-digit number)
26419657511725799533…92011760696919597439
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.641 × 10¹⁰¹(102-digit number)
26419657511725799533…92011760696919597439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.283 × 10¹⁰¹(102-digit number)
52839315023451599066…84023521393839194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.056 × 10¹⁰²(103-digit number)
10567863004690319813…68047042787678389759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.113 × 10¹⁰²(103-digit number)
21135726009380639626…36094085575356779519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.227 × 10¹⁰²(103-digit number)
42271452018761279253…72188171150713559039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.454 × 10¹⁰²(103-digit number)
84542904037522558506…44376342301427118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.690 × 10¹⁰³(104-digit number)
16908580807504511701…88752684602854236159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.381 × 10¹⁰³(104-digit number)
33817161615009023402…77505369205708472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.763 × 10¹⁰³(104-digit number)
67634323230018046804…55010738411416944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.352 × 10¹⁰⁴(105-digit number)
13526864646003609360…10021476822833889279
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,713,853 XPM·at block #6,808,725 · 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