Block #391,407

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/5/2014, 7:05:46 PM · Difficulty 10.4317 · 6,434,847 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
91ac4c598b8d4892c82f7cda1a61b4cfd26fd329950343202fdeeb1037c7e608

Height

#391,407

Difficulty

10.431677

Transactions

5

Size

1.60 KB

Version

2

Bits

0a6e8269

Nonce

194,635

Timestamp

2/5/2014, 7:05:46 PM

Confirmations

6,434,847

Merkle Root

41ee9bc0d704342d41d5236d9fa25b908e690915174fee70c1c36e1b39110148
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.042 × 10⁹⁷(98-digit number)
90421444783332173071…59887064606330946049
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.042 × 10⁹⁷(98-digit number)
90421444783332173071…59887064606330946049
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.808 × 10⁹⁸(99-digit number)
18084288956666434614…19774129212661892099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.616 × 10⁹⁸(99-digit number)
36168577913332869228…39548258425323784199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.233 × 10⁹⁸(99-digit number)
72337155826665738457…79096516850647568399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.446 × 10⁹⁹(100-digit number)
14467431165333147691…58193033701295136799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.893 × 10⁹⁹(100-digit number)
28934862330666295382…16386067402590273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.786 × 10⁹⁹(100-digit number)
57869724661332590765…32772134805180547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.157 × 10¹⁰⁰(101-digit number)
11573944932266518153…65544269610361094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.314 × 10¹⁰⁰(101-digit number)
23147889864533036306…31088539220722188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.629 × 10¹⁰⁰(101-digit number)
46295779729066072612…62177078441444377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.259 × 10¹⁰⁰(101-digit number)
92591559458132145225…24354156882888755199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,854,166 XPM·at block #6,826,253 · 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