Block #341,776

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 4:10:38 PM · Difficulty 10.1444 · 6,475,138 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8cba32d77015d2572d86f62c172804dcaf92d54276c4864905325f9de82107d8

Height

#341,776

Difficulty

10.144426

Transactions

16

Size

11.13 KB

Version

2

Bits

0a24f916

Nonce

81,259

Timestamp

1/3/2014, 4:10:38 PM

Confirmations

6,475,138

Merkle Root

7d2f75b136ee643adff0391cd347ba3f0ea516dc06f4ed9d6a97e0a355e66e79
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.764 × 10¹⁰⁰(101-digit number)
17647777477306616984…75414396205700494281
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.764 × 10¹⁰⁰(101-digit number)
17647777477306616984…75414396205700494281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.529 × 10¹⁰⁰(101-digit number)
35295554954613233969…50828792411400988561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.059 × 10¹⁰⁰(101-digit number)
70591109909226467939…01657584822801977121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.411 × 10¹⁰¹(102-digit number)
14118221981845293587…03315169645603954241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.823 × 10¹⁰¹(102-digit number)
28236443963690587175…06630339291207908481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.647 × 10¹⁰¹(102-digit number)
56472887927381174351…13260678582415816961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.129 × 10¹⁰²(103-digit number)
11294577585476234870…26521357164831633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.258 × 10¹⁰²(103-digit number)
22589155170952469740…53042714329663267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.517 × 10¹⁰²(103-digit number)
45178310341904939481…06085428659326535681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.035 × 10¹⁰²(103-digit number)
90356620683809878963…12170857318653071361
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,779,353 XPM·at block #6,816,913 · 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