Block #361,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 5:10:10 AM · Difficulty 10.4069 · 6,445,559 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c22ddcf290ab06264b0d13f497903bb2b2b707546d4dba951a4b43f12cae889c

Height

#361,642

Difficulty

10.406875

Transactions

4

Size

2.83 KB

Version

2

Bits

0a6828f7

Nonce

127,030

Timestamp

1/16/2014, 5:10:10 AM

Confirmations

6,445,559

Merkle Root

feda7a29d1c40b72112aefd0ea98f1cffcf2ee84f43aeeb3cede8cfc37fc617e
Transactions (4)
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.245 × 10⁹⁶(97-digit number)
32451155021192272761…35228309870106869761
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.245 × 10⁹⁶(97-digit number)
32451155021192272761…35228309870106869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.490 × 10⁹⁶(97-digit number)
64902310042384545522…70456619740213739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.298 × 10⁹⁷(98-digit number)
12980462008476909104…40913239480427479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.596 × 10⁹⁷(98-digit number)
25960924016953818208…81826478960854958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.192 × 10⁹⁷(98-digit number)
51921848033907636417…63652957921709916161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.038 × 10⁹⁸(99-digit number)
10384369606781527283…27305915843419832321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.076 × 10⁹⁸(99-digit number)
20768739213563054567…54611831686839664641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.153 × 10⁹⁸(99-digit number)
41537478427126109134…09223663373679329281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.307 × 10⁹⁸(99-digit number)
83074956854252218268…18447326747358658561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.661 × 10⁹⁹(100-digit number)
16614991370850443653…36894653494717317121
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,701,622 XPM·at block #6,807,200 · 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