Block #353,346

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 9:29:06 PM · Difficulty 10.3245 · 6,471,413 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2c23eb08870d745abfdadea374a0c92ed92709dbf08390913bc53a5be2b5a99

Height

#353,346

Difficulty

10.324506

Transactions

11

Size

3.82 KB

Version

2

Bits

0a5312d2

Nonce

517,393

Timestamp

1/10/2014, 9:29:06 PM

Confirmations

6,471,413

Merkle Root

745c3f798b82b99c5f19bc707958248ecfe155a4203e11e3a2cec0f6d7e4c6e7
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.494 × 10⁹⁹(100-digit number)
14949525234475706513…70346310612574004801
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.494 × 10⁹⁹(100-digit number)
14949525234475706513…70346310612574004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.989 × 10⁹⁹(100-digit number)
29899050468951413027…40692621225148009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.979 × 10⁹⁹(100-digit number)
59798100937902826055…81385242450296019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.195 × 10¹⁰⁰(101-digit number)
11959620187580565211…62770484900592038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.391 × 10¹⁰⁰(101-digit number)
23919240375161130422…25540969801184076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.783 × 10¹⁰⁰(101-digit number)
47838480750322260844…51081939602368153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.567 × 10¹⁰⁰(101-digit number)
95676961500644521689…02163879204736307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.913 × 10¹⁰¹(102-digit number)
19135392300128904337…04327758409472614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.827 × 10¹⁰¹(102-digit number)
38270784600257808675…08655516818945228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.654 × 10¹⁰¹(102-digit number)
76541569200515617351…17311033637890457601
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,842,144 XPM·at block #6,824,758 · 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