Block #396,188

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 6:12:41 AM · Difficulty 10.4097 · 6,428,569 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
14659dff74282ca3d7b7ab13cae1f32d45badb4304f5f92f57db8488b231f04a

Height

#396,188

Difficulty

10.409656

Transactions

7

Size

1.96 KB

Version

2

Bits

0a68df3f

Nonce

16,918

Timestamp

2/9/2014, 6:12:41 AM

Confirmations

6,428,569

Merkle Root

6ec910963c21e1b4139e9875138edbb78b1aa60fb9dcf76e5c4e9cbd3fb37a11
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.

5.348 × 10⁹⁷(98-digit number)
53487211500952574887…05563709380286236159
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
5.348 × 10⁹⁷(98-digit number)
53487211500952574887…05563709380286236159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.069 × 10⁹⁸(99-digit number)
10697442300190514977…11127418760572472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.139 × 10⁹⁸(99-digit number)
21394884600381029955…22254837521144944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.278 × 10⁹⁸(99-digit number)
42789769200762059910…44509675042289889279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.557 × 10⁹⁸(99-digit number)
85579538401524119820…89019350084579778559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.711 × 10⁹⁹(100-digit number)
17115907680304823964…78038700169159557119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.423 × 10⁹⁹(100-digit number)
34231815360609647928…56077400338319114239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.846 × 10⁹⁹(100-digit number)
68463630721219295856…12154800676638228479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.369 × 10¹⁰⁰(101-digit number)
13692726144243859171…24309601353276456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.738 × 10¹⁰⁰(101-digit number)
27385452288487718342…48619202706552913919
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,842,127 XPM·at block #6,824,756 · 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