Block #348,879

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 1:37:47 AM · Difficulty 10.2679 · 6,462,071 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e270a21ab03234ba89b5070b255feedeaccb48eeed347126e79cb826807351b2

Height

#348,879

Difficulty

10.267905

Transactions

8

Size

4.48 KB

Version

2

Bits

0a449565

Nonce

420,687

Timestamp

1/8/2014, 1:37:47 AM

Confirmations

6,462,071

Merkle Root

2d472e6164c9e2ed4cf4c20d416435e5c06ca10431c4de78a1fe5c59c7d21cba
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.

2.402 × 10⁹⁷(98-digit number)
24020881160752733117…56117070860385756161
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
2.402 × 10⁹⁷(98-digit number)
24020881160752733117…56117070860385756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.804 × 10⁹⁷(98-digit number)
48041762321505466234…12234141720771512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.608 × 10⁹⁷(98-digit number)
96083524643010932469…24468283441543024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.921 × 10⁹⁸(99-digit number)
19216704928602186493…48936566883086049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.843 × 10⁹⁸(99-digit number)
38433409857204372987…97873133766172098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.686 × 10⁹⁸(99-digit number)
76866819714408745975…95746267532344197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.537 × 10⁹⁹(100-digit number)
15373363942881749195…91492535064688394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.074 × 10⁹⁹(100-digit number)
30746727885763498390…82985070129376788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.149 × 10⁹⁹(100-digit number)
61493455771526996780…65970140258753576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.229 × 10¹⁰⁰(101-digit number)
12298691154305399356…31940280517507153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.459 × 10¹⁰⁰(101-digit number)
24597382308610798712…63880561035014307841
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 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
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 2CC formula:

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