Block #348,447

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 7:30:20 PM · Difficulty 10.2582 · 6,462,253 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76435910c050ab37858f3bcdd154508232e1897290295b688567245da160a35f

Height

#348,447

Difficulty

10.258175

Transactions

13

Size

2.99 KB

Version

2

Bits

0a4217bd

Nonce

20,029

Timestamp

1/7/2014, 7:30:20 PM

Confirmations

6,462,253

Merkle Root

4cfd2ffc675f85b7b8bf20a4a47cc51f228f1e4514e1c2f749486dd8fe6ac52d
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.

3.280 × 10¹⁰⁵(106-digit number)
32807598367855847545…61002067188180756481
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
3.280 × 10¹⁰⁵(106-digit number)
32807598367855847545…61002067188180756481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.561 × 10¹⁰⁵(106-digit number)
65615196735711695090…22004134376361512961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.312 × 10¹⁰⁶(107-digit number)
13123039347142339018…44008268752723025921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.624 × 10¹⁰⁶(107-digit number)
26246078694284678036…88016537505446051841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.249 × 10¹⁰⁶(107-digit number)
52492157388569356072…76033075010892103681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10¹⁰⁷(108-digit number)
10498431477713871214…52066150021784207361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.099 × 10¹⁰⁷(108-digit number)
20996862955427742429…04132300043568414721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.199 × 10¹⁰⁷(108-digit number)
41993725910855484858…08264600087136829441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.398 × 10¹⁰⁷(108-digit number)
83987451821710969716…16529200174273658881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.679 × 10¹⁰⁸(109-digit number)
16797490364342193943…33058400348547317761
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,729,693 XPM·at block #6,810,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.

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