Block #397,061

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 7:54:17 PM · Difficulty 10.4159 · 6,409,295 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
105a12d33bc0b5d6bab2a294bd995cd4dc58cd5c93f17e21852a54763f66f8b2

Height

#397,061

Difficulty

10.415894

Transactions

5

Size

1.22 KB

Version

2

Bits

0a6a7809

Nonce

93,468

Timestamp

2/9/2014, 7:54:17 PM

Confirmations

6,409,295

Merkle Root

1ea0c46bb14af7f1f49081b2e82c7802c69589d562bcc4f28039434a0f80d1a1
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.527 × 10⁹⁹(100-digit number)
15278656274757342828…46123607228723022081
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.527 × 10⁹⁹(100-digit number)
15278656274757342828…46123607228723022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.055 × 10⁹⁹(100-digit number)
30557312549514685656…92247214457446044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.111 × 10⁹⁹(100-digit number)
61114625099029371313…84494428914892088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.222 × 10¹⁰⁰(101-digit number)
12222925019805874262…68988857829784176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.444 × 10¹⁰⁰(101-digit number)
24445850039611748525…37977715659568353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.889 × 10¹⁰⁰(101-digit number)
48891700079223497050…75955431319136706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.778 × 10¹⁰⁰(101-digit number)
97783400158446994101…51910862638273413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.955 × 10¹⁰¹(102-digit number)
19556680031689398820…03821725276546826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.911 × 10¹⁰¹(102-digit number)
39113360063378797640…07643450553093652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.822 × 10¹⁰¹(102-digit number)
78226720126757595281…15286901106187304961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,694,935 XPM·at block #6,806,355 · 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