Block #346,720

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 5:41:16 PM · Difficulty 10.2313 · 6,477,980 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d3b57be8502009afbacbfe7543b200932e8361156bd3f504cdc1d928869107a

Height

#346,720

Difficulty

10.231339

Transactions

1

Size

902 B

Version

2

Bits

0a3b390f

Nonce

43,060

Timestamp

1/6/2014, 5:41:16 PM

Confirmations

6,477,980

Merkle Root

7d616fb24c95420e96163f21de6be15dc76c3923bd56f25897069bae0bb2f49b
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.578 × 10⁹⁶(97-digit number)
15787717426131380221…16461303645759056641
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.578 × 10⁹⁶(97-digit number)
15787717426131380221…16461303645759056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.157 × 10⁹⁶(97-digit number)
31575434852262760443…32922607291518113281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.315 × 10⁹⁶(97-digit number)
63150869704525520886…65845214583036226561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.263 × 10⁹⁷(98-digit number)
12630173940905104177…31690429166072453121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.526 × 10⁹⁷(98-digit number)
25260347881810208354…63380858332144906241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.052 × 10⁹⁷(98-digit number)
50520695763620416709…26761716664289812481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.010 × 10⁹⁸(99-digit number)
10104139152724083341…53523433328579624961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.020 × 10⁹⁸(99-digit number)
20208278305448166683…07046866657159249921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.041 × 10⁹⁸(99-digit number)
40416556610896333367…14093733314318499841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.083 × 10⁹⁸(99-digit number)
80833113221792666734…28187466628636999681
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,841,667 XPM·at block #6,824,699 · 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