Block #400,791

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 8:16:00 AM · Difficulty 10.4304 · 6,405,784 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c19c84a47471646d1bbf13180609bfe9ea232aae34c43083779906a071cb9b5

Height

#400,791

Difficulty

10.430353

Transactions

9

Size

3.82 KB

Version

2

Bits

0a6e2ba1

Nonce

24,275,157

Timestamp

2/12/2014, 8:16:00 AM

Confirmations

6,405,784

Merkle Root

661a8008847bf2211b5a533f3924e09172cdb9b432b59c94e02a97c50c579e65
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.

3.417 × 10⁹⁷(98-digit number)
34177511300000869564…98417247769667055199
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
3.417 × 10⁹⁷(98-digit number)
34177511300000869564…98417247769667055199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.835 × 10⁹⁷(98-digit number)
68355022600001739129…96834495539334110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.367 × 10⁹⁸(99-digit number)
13671004520000347825…93668991078668220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.734 × 10⁹⁸(99-digit number)
27342009040000695651…87337982157336441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.468 × 10⁹⁸(99-digit number)
54684018080001391303…74675964314672883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.093 × 10⁹⁹(100-digit number)
10936803616000278260…49351928629345766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.187 × 10⁹⁹(100-digit number)
21873607232000556521…98703857258691532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.374 × 10⁹⁹(100-digit number)
43747214464001113042…97407714517383065599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.749 × 10⁹⁹(100-digit number)
87494428928002226085…94815429034766131199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.749 × 10¹⁰⁰(101-digit number)
17498885785600445217…89630858069532262399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.499 × 10¹⁰⁰(101-digit number)
34997771571200890434…79261716139064524799
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,696,695 XPM·at block #6,806,574 · 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