Block #362,682

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 9:09:10 PM · Difficulty 10.4166 · 6,453,499 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0a480b833a4777ced8072bb2414439025b1976a1d899e8fa6991aac295159c85

Height

#362,682

Difficulty

10.416590

Transactions

11

Size

4.44 KB

Version

2

Bits

0a6aa59f

Nonce

193,436

Timestamp

1/16/2014, 9:09:10 PM

Confirmations

6,453,499

Merkle Root

5f3c34a11edd54f5df072d731d657dd7ad7411d8891bbeb1724262ce1331f8df
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.

2.692 × 10¹⁰⁵(106-digit number)
26927353536836375800…90428867340732857041
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
2.692 × 10¹⁰⁵(106-digit number)
26927353536836375800…90428867340732857041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.385 × 10¹⁰⁵(106-digit number)
53854707073672751601…80857734681465714081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.077 × 10¹⁰⁶(107-digit number)
10770941414734550320…61715469362931428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.154 × 10¹⁰⁶(107-digit number)
21541882829469100640…23430938725862856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.308 × 10¹⁰⁶(107-digit number)
43083765658938201280…46861877451725712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.616 × 10¹⁰⁶(107-digit number)
86167531317876402561…93723754903451425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.723 × 10¹⁰⁷(108-digit number)
17233506263575280512…87447509806902850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.446 × 10¹⁰⁷(108-digit number)
34467012527150561024…74895019613805701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.893 × 10¹⁰⁷(108-digit number)
68934025054301122049…49790039227611402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.378 × 10¹⁰⁸(109-digit number)
13786805010860224409…99580078455222804481
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,773,573 XPM·at block #6,816,180 · 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