Block #361,800

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 7:32:47 AM · Difficulty 10.4087 · 6,454,506 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9e3ea9516638665dd536560eac07ab971e3cdc6fa20bae8a6fef4f300bcb171

Height

#361,800

Difficulty

10.408749

Transactions

3

Size

9.05 KB

Version

2

Bits

0a68a3c4

Nonce

9,559

Timestamp

1/16/2014, 7:32:47 AM

Confirmations

6,454,506

Merkle Root

0fcafff32255ed764b13d4444bdb79fdb8761ebfcba68ef8c527549abd4c197d
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.005 × 10¹⁰³(104-digit number)
20057017141789323635…50832548253805624321
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.005 × 10¹⁰³(104-digit number)
20057017141789323635…50832548253805624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.011 × 10¹⁰³(104-digit number)
40114034283578647270…01665096507611248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.022 × 10¹⁰³(104-digit number)
80228068567157294540…03330193015222497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.604 × 10¹⁰⁴(105-digit number)
16045613713431458908…06660386030444994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.209 × 10¹⁰⁴(105-digit number)
32091227426862917816…13320772060889989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.418 × 10¹⁰⁴(105-digit number)
64182454853725835632…26641544121779978241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.283 × 10¹⁰⁵(106-digit number)
12836490970745167126…53283088243559956481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.567 × 10¹⁰⁵(106-digit number)
25672981941490334253…06566176487119912961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.134 × 10¹⁰⁵(106-digit number)
51345963882980668506…13132352974239825921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.026 × 10¹⁰⁶(107-digit number)
10269192776596133701…26264705948479651841
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,774,568 XPM·at block #6,816,305 · 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