Block #345,573

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 12:42:51 AM · Difficulty 10.2114 · 6,468,902 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0b69b8d776b0355c9818707af673f10126cc490addedcba5e9042aac9aff5fc4

Height

#345,573

Difficulty

10.211366

Transactions

7

Size

1.52 KB

Version

2

Bits

0a361c13

Nonce

245,973

Timestamp

1/6/2014, 12:42:51 AM

Confirmations

6,468,902

Merkle Root

c5e23eddf1523c23b92b6bc424169cf2ea49dfae6f06d54e81af09eaee4d8182
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.028 × 10¹⁰³(104-digit number)
10283643770822169728…56239138483625726581
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.028 × 10¹⁰³(104-digit number)
10283643770822169728…56239138483625726581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.056 × 10¹⁰³(104-digit number)
20567287541644339456…12478276967251453161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.113 × 10¹⁰³(104-digit number)
41134575083288678913…24956553934502906321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.226 × 10¹⁰³(104-digit number)
82269150166577357827…49913107869005812641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.645 × 10¹⁰⁴(105-digit number)
16453830033315471565…99826215738011625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.290 × 10¹⁰⁴(105-digit number)
32907660066630943130…99652431476023250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.581 × 10¹⁰⁴(105-digit number)
65815320133261886261…99304862952046501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.316 × 10¹⁰⁵(106-digit number)
13163064026652377252…98609725904093002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.632 × 10¹⁰⁵(106-digit number)
26326128053304754504…97219451808186004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.265 × 10¹⁰⁵(106-digit number)
52652256106609509009…94438903616372008961
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,759,875 XPM·at block #6,814,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.
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