Block #341,356

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 9:49:13 AM · Difficulty 10.1373 · 6,465,119 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94d0194ffc68198ae8d0265367f25907a8ec5b3e715ac9aa43103d66cd12bd03

Height

#341,356

Difficulty

10.137270

Transactions

4

Size

1.44 KB

Version

2

Bits

0a232421

Nonce

21,099

Timestamp

1/3/2014, 9:49:13 AM

Confirmations

6,465,119

Merkle Root

65457b49b79e15843b50a0359c797729ab5080cb07d64e7f15b64eb8d4ca8927
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.

7.796 × 10⁹⁸(99-digit number)
77960621911941978671…81756569093213855681
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
7.796 × 10⁹⁸(99-digit number)
77960621911941978671…81756569093213855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.559 × 10⁹⁹(100-digit number)
15592124382388395734…63513138186427711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.118 × 10⁹⁹(100-digit number)
31184248764776791468…27026276372855422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.236 × 10⁹⁹(100-digit number)
62368497529553582937…54052552745710845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.247 × 10¹⁰⁰(101-digit number)
12473699505910716587…08105105491421690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.494 × 10¹⁰⁰(101-digit number)
24947399011821433174…16210210982843381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.989 × 10¹⁰⁰(101-digit number)
49894798023642866349…32420421965686763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.978 × 10¹⁰⁰(101-digit number)
99789596047285732699…64840843931373527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.995 × 10¹⁰¹(102-digit number)
19957919209457146539…29681687862747054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.991 × 10¹⁰¹(102-digit number)
39915838418914293079…59363375725494108161
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,695,891 XPM·at block #6,806,474 · 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