Block #408,325

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2014, 2:05:42 PM · Difficulty 10.4309 · 6,417,211 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1e39eae9fe7aaf42949b35f829bfbd7272fb67a5989ea474ad472dbad194260

Height

#408,325

Difficulty

10.430861

Transactions

1

Size

210 B

Version

2

Bits

0a6e4ceb

Nonce

21,874

Timestamp

2/17/2014, 2:05:42 PM

Confirmations

6,417,211

Merkle Root

382b11ccbccfc8e79513a3829607c03d74f958064fe2afed3ca0daa12e8cef8b
Transactions (1)
1 in → 1 out9.1800 XPM116 B
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.

8.530 × 10¹⁰⁴(105-digit number)
85309556898157779988…18390916622566031359
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
8.530 × 10¹⁰⁴(105-digit number)
85309556898157779988…18390916622566031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.706 × 10¹⁰⁵(106-digit number)
17061911379631555997…36781833245132062719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.412 × 10¹⁰⁵(106-digit number)
34123822759263111995…73563666490264125439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.824 × 10¹⁰⁵(106-digit number)
68247645518526223990…47127332980528250879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.364 × 10¹⁰⁶(107-digit number)
13649529103705244798…94254665961056501759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.729 × 10¹⁰⁶(107-digit number)
27299058207410489596…88509331922113003519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.459 × 10¹⁰⁶(107-digit number)
54598116414820979192…77018663844226007039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.091 × 10¹⁰⁷(108-digit number)
10919623282964195838…54037327688452014079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.183 × 10¹⁰⁷(108-digit number)
21839246565928391677…08074655376904028159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.367 × 10¹⁰⁷(108-digit number)
43678493131856783354…16149310753808056319
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,848,386 XPM·at block #6,825,535 · 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