Block #391,784

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 1:47:26 AM · Difficulty 10.4291 · 6,424,397 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62654a964458775febd6025a6a46724b4d04fc28b80b0785fd47a839aa513ba9

Height

#391,784

Difficulty

10.429119

Transactions

3

Size

1.07 KB

Version

2

Bits

0a6ddabe

Nonce

615,972

Timestamp

2/6/2014, 1:47:26 AM

Confirmations

6,424,397

Merkle Root

13c802476132fab5a1d4e18b4c6f649871c8cc25279b0690fc44561f7bd5aeae
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.821 × 10⁹⁸(99-digit number)
88215815856168906490…25476240370503710919
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.821 × 10⁹⁸(99-digit number)
88215815856168906490…25476240370503710919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.764 × 10⁹⁹(100-digit number)
17643163171233781298…50952480741007421839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.528 × 10⁹⁹(100-digit number)
35286326342467562596…01904961482014843679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.057 × 10⁹⁹(100-digit number)
70572652684935125192…03809922964029687359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.411 × 10¹⁰⁰(101-digit number)
14114530536987025038…07619845928059374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.822 × 10¹⁰⁰(101-digit number)
28229061073974050077…15239691856118749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.645 × 10¹⁰⁰(101-digit number)
56458122147948100154…30479383712237498879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.129 × 10¹⁰¹(102-digit number)
11291624429589620030…60958767424474997759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.258 × 10¹⁰¹(102-digit number)
22583248859179240061…21917534848949995519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.516 × 10¹⁰¹(102-digit number)
45166497718358480123…43835069697899991039
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,773,573 XPM·at block #6,816,180 · 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