Block #342,345

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 12:30:03 AM · Difficulty 10.1563 · 6,466,280 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eae1527af445f1f004c18e511d75e71b7d2d90b0172eb58ad975147918208368

Height

#342,345

Difficulty

10.156303

Transactions

5

Size

1.22 KB

Version

2

Bits

0a280377

Nonce

142,453

Timestamp

1/4/2014, 12:30:03 AM

Confirmations

6,466,280

Merkle Root

47745583ef752f1cc7b4e78cdb10ce268787d59a8cac794a7804454ea659ecad
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.857 × 10⁹⁴(95-digit number)
78578732480818316705…90053576033676839681
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.857 × 10⁹⁴(95-digit number)
78578732480818316705…90053576033676839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.571 × 10⁹⁵(96-digit number)
15715746496163663341…80107152067353679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.143 × 10⁹⁵(96-digit number)
31431492992327326682…60214304134707358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.286 × 10⁹⁵(96-digit number)
62862985984654653364…20428608269414717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.257 × 10⁹⁶(97-digit number)
12572597196930930672…40857216538829434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.514 × 10⁹⁶(97-digit number)
25145194393861861345…81714433077658869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.029 × 10⁹⁶(97-digit number)
50290388787723722691…63428866155317739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.005 × 10⁹⁷(98-digit number)
10058077757544744538…26857732310635479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.011 × 10⁹⁷(98-digit number)
20116155515089489076…53715464621270958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.023 × 10⁹⁷(98-digit number)
40232311030178978153…07430929242541916161
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,713,051 XPM·at block #6,808,624 · 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