Block #401,104

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 1:02:55 PM · Difficulty 10.4330 · 6,415,756 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c48a387ce22d4326b2388b22cb7859a07bf31de4e9698d41733f45f37d78092f

Height

#401,104

Difficulty

10.433020

Transactions

6

Size

1.53 KB

Version

2

Bits

0a6eda68

Nonce

3,848

Timestamp

2/12/2014, 1:02:55 PM

Confirmations

6,415,756

Merkle Root

5d7a22c1e69ff1f8b5b136141c5c562e35458a15a3de5ac14692db5253db66c6
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.

9.802 × 10¹⁰⁰(101-digit number)
98024404196630361613…12170989933970137599
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
9.802 × 10¹⁰⁰(101-digit number)
98024404196630361613…12170989933970137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.960 × 10¹⁰¹(102-digit number)
19604880839326072322…24341979867940275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.920 × 10¹⁰¹(102-digit number)
39209761678652144645…48683959735880550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.841 × 10¹⁰¹(102-digit number)
78419523357304289290…97367919471761100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.568 × 10¹⁰²(103-digit number)
15683904671460857858…94735838943522201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.136 × 10¹⁰²(103-digit number)
31367809342921715716…89471677887044403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.273 × 10¹⁰²(103-digit number)
62735618685843431432…78943355774088806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.254 × 10¹⁰³(104-digit number)
12547123737168686286…57886711548177612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.509 × 10¹⁰³(104-digit number)
25094247474337372572…15773423096355225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.018 × 10¹⁰³(104-digit number)
50188494948674745145…31546846192710451199
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,778,923 XPM·at block #6,816,859 · 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