Block #347,083

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 11:03:29 PM · Difficulty 10.2376 · 6,477,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b43bcfe8c7d3325245cbec376845a4ae9f09894b644a6cc0a726aff7dda51861

Height

#347,083

Difficulty

10.237610

Transactions

4

Size

7.63 KB

Version

2

Bits

0a3cd3fa

Nonce

141,329

Timestamp

1/6/2014, 11:03:29 PM

Confirmations

6,477,487

Merkle Root

b0b094a01845fde5a1938bba44ffcc7908eebdb9ccd9cc815c6d249cc0d5cdcd
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.566 × 10¹⁰⁰(101-digit number)
35667221688648241524…39719991186800884481
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.566 × 10¹⁰⁰(101-digit number)
35667221688648241524…39719991186800884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.133 × 10¹⁰⁰(101-digit number)
71334443377296483048…79439982373601768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.426 × 10¹⁰¹(102-digit number)
14266888675459296609…58879964747203537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.853 × 10¹⁰¹(102-digit number)
28533777350918593219…17759929494407075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.706 × 10¹⁰¹(102-digit number)
57067554701837186438…35519858988814151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.141 × 10¹⁰²(103-digit number)
11413510940367437287…71039717977628303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.282 × 10¹⁰²(103-digit number)
22827021880734874575…42079435955256606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.565 × 10¹⁰²(103-digit number)
45654043761469749151…84158871910513213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.130 × 10¹⁰²(103-digit number)
91308087522939498302…68317743821026426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.826 × 10¹⁰³(104-digit number)
18261617504587899660…36635487642052853761
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,840,625 XPM·at block #6,824,569 · 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