Block #406,163

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 1:36:46 AM · Difficulty 10.4334 · 6,410,229 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7871e2e45cc0acc9f5d13960785a87f267c6ef572700cf8fa16dfc5cfa92698e

Height

#406,163

Difficulty

10.433441

Transactions

8

Size

3.45 KB

Version

2

Bits

0a6ef601

Nonce

5,390

Timestamp

2/16/2014, 1:36:46 AM

Confirmations

6,410,229

Merkle Root

6516ba8b8f55e3a74ad8754b7d349aa04270a20d2b24f06284d00a35f5f93398
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.276 × 10⁹⁷(98-digit number)
12768952912028635402…34354399484343524159
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.276 × 10⁹⁷(98-digit number)
12768952912028635402…34354399484343524159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.553 × 10⁹⁷(98-digit number)
25537905824057270805…68708798968687048319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.107 × 10⁹⁷(98-digit number)
51075811648114541611…37417597937374096639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.021 × 10⁹⁸(99-digit number)
10215162329622908322…74835195874748193279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.043 × 10⁹⁸(99-digit number)
20430324659245816644…49670391749496386559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.086 × 10⁹⁸(99-digit number)
40860649318491633289…99340783498992773119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.172 × 10⁹⁸(99-digit number)
81721298636983266578…98681566997985546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.634 × 10⁹⁹(100-digit number)
16344259727396653315…97363133995971092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.268 × 10⁹⁹(100-digit number)
32688519454793306631…94726267991942184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.537 × 10⁹⁹(100-digit number)
65377038909586613263…89452535983884369919
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,775,259 XPM·at block #6,816,391 · 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