Block #368,650

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/20/2014, 8:55:56 PM · Difficulty 10.4442 · 6,446,431 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7b74100e5e115d000c49c6cce924e2dfe64166f87d3fc35aaee3fe9337278aa0

Height

#368,650

Difficulty

10.444196

Transactions

6

Size

1.76 KB

Version

2

Bits

0a71b6d0

Nonce

10,417

Timestamp

1/20/2014, 8:55:56 PM

Confirmations

6,446,431

Merkle Root

113c82b6d125427fd7b3cc564b5b811313aa03bb3761e8c5f09e934b7a70f57f
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.629 × 10¹⁰³(104-digit number)
16299995427300019795…40091586253045975361
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.629 × 10¹⁰³(104-digit number)
16299995427300019795…40091586253045975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.259 × 10¹⁰³(104-digit number)
32599990854600039591…80183172506091950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.519 × 10¹⁰³(104-digit number)
65199981709200079182…60366345012183901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.303 × 10¹⁰⁴(105-digit number)
13039996341840015836…20732690024367802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.607 × 10¹⁰⁴(105-digit number)
26079992683680031672…41465380048735605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.215 × 10¹⁰⁴(105-digit number)
52159985367360063345…82930760097471211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.043 × 10¹⁰⁵(106-digit number)
10431997073472012669…65861520194942423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.086 × 10¹⁰⁵(106-digit number)
20863994146944025338…31723040389884846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.172 × 10¹⁰⁵(106-digit number)
41727988293888050676…63446080779769692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.345 × 10¹⁰⁵(106-digit number)
83455976587776101353…26892161559539384321
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,764,734 XPM·at block #6,815,080 · 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