Block #362,307

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2014, 3:11:55 PM · Difficulty 10.4144 · 6,453,679 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c4d27eed4aef7eae107ab6bb669fbff4fbd1c7fee1c00e78e9d70be3c0211e5

Height

#362,307

Difficulty

10.414419

Transactions

4

Size

886 B

Version

2

Bits

0a6a1755

Nonce

4,788

Timestamp

1/16/2014, 3:11:55 PM

Confirmations

6,453,679

Merkle Root

c2cce0a747364a928e856fe1cd03d71f038b45ec7344eee0be9b97b438b2332d
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.

1.465 × 10¹⁰⁵(106-digit number)
14651066566435460175…51415824426409656321
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
1.465 × 10¹⁰⁵(106-digit number)
14651066566435460175…51415824426409656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.930 × 10¹⁰⁵(106-digit number)
29302133132870920351…02831648852819312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.860 × 10¹⁰⁵(106-digit number)
58604266265741840703…05663297705638625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.172 × 10¹⁰⁶(107-digit number)
11720853253148368140…11326595411277250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.344 × 10¹⁰⁶(107-digit number)
23441706506296736281…22653190822554501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.688 × 10¹⁰⁶(107-digit number)
46883413012593472562…45306381645109002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.376 × 10¹⁰⁶(107-digit number)
93766826025186945125…90612763290218004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.875 × 10¹⁰⁷(108-digit number)
18753365205037389025…81225526580436008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.750 × 10¹⁰⁷(108-digit number)
37506730410074778050…62451053160872017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.501 × 10¹⁰⁷(108-digit number)
75013460820149556100…24902106321744035841
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,772,002 XPM·at block #6,815,985 · 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