Block #356,437

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2014, 6:13:10 PM · Difficulty 10.3782 · 6,452,705 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76a7222e515990971043a56c8d7b3eaef513cccf6aac603842a7948431f6ec98

Height

#356,437

Difficulty

10.378232

Transactions

8

Size

2.40 KB

Version

2

Bits

0a60d3ce

Nonce

13,624

Timestamp

1/12/2014, 6:13:10 PM

Confirmations

6,452,705

Merkle Root

6f1e2c1d7b64b77f4dd083b125f6ca40ca8411908a7989fdf16756dfbc7932a5
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.

6.511 × 10¹⁰⁰(101-digit number)
65113269026953733646…42167631804018744321
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
6.511 × 10¹⁰⁰(101-digit number)
65113269026953733646…42167631804018744321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.302 × 10¹⁰¹(102-digit number)
13022653805390746729…84335263608037488641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.604 × 10¹⁰¹(102-digit number)
26045307610781493458…68670527216074977281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.209 × 10¹⁰¹(102-digit number)
52090615221562986917…37341054432149954561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.041 × 10¹⁰²(103-digit number)
10418123044312597383…74682108864299909121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.083 × 10¹⁰²(103-digit number)
20836246088625194766…49364217728599818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.167 × 10¹⁰²(103-digit number)
41672492177250389533…98728435457199636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.334 × 10¹⁰²(103-digit number)
83344984354500779067…97456870914399272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.666 × 10¹⁰³(104-digit number)
16668996870900155813…94913741828798545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.333 × 10¹⁰³(104-digit number)
33337993741800311626…89827483657597091841
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,717,197 XPM·at block #6,809,141 · 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