Block #387,853

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/3/2014, 10:05:46 AM · Difficulty 10.4156 · 6,421,478 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
96835392f22d66cdf65f52d40b716a58ef5d8360f9ebb7892fa1662ec10800f2

Height

#387,853

Difficulty

10.415554

Transactions

7

Size

11.62 KB

Version

2

Bits

0a6a61c4

Nonce

155,429

Timestamp

2/3/2014, 10:05:46 AM

Confirmations

6,421,478

Merkle Root

88f9b2e107d299dd8e0aa51d7c83c3901b2af5916001f042614c25e4fc421a5d
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.

1.240 × 10⁹⁸(99-digit number)
12403725431638480344…99743550080030332159
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
1.240 × 10⁹⁸(99-digit number)
12403725431638480344…99743550080030332159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.480 × 10⁹⁸(99-digit number)
24807450863276960689…99487100160060664319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.961 × 10⁹⁸(99-digit number)
49614901726553921379…98974200320121328639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.922 × 10⁹⁸(99-digit number)
99229803453107842759…97948400640242657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.984 × 10⁹⁹(100-digit number)
19845960690621568551…95896801280485314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.969 × 10⁹⁹(100-digit number)
39691921381243137103…91793602560970629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.938 × 10⁹⁹(100-digit number)
79383842762486274207…83587205121941258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.587 × 10¹⁰⁰(101-digit number)
15876768552497254841…67174410243882516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.175 × 10¹⁰⁰(101-digit number)
31753537104994509683…34348820487765032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.350 × 10¹⁰⁰(101-digit number)
63507074209989019366…68697640975530065919
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,718,714 XPM·at block #6,809,330 · 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