Block #371,519

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/22/2014, 10:23:41 PM · Difficulty 10.4340 · 6,436,578 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
209c8887be2d6ecf3a8520017f868a40cb7b6e97c8f461c5111cc77ff7d1a2be

Height

#371,519

Difficulty

10.434001

Transactions

19

Size

5.43 KB

Version

2

Bits

0a6f1ab0

Nonce

42,968

Timestamp

1/22/2014, 10:23:41 PM

Confirmations

6,436,578

Merkle Root

b1dec7e8255a42649cb6c999484470deb86ecebe7b2bfb65cb4e5043c9255b3c
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.353 × 10¹⁰²(103-digit number)
13531466888504651485…28626699355652967681
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.353 × 10¹⁰²(103-digit number)
13531466888504651485…28626699355652967681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.706 × 10¹⁰²(103-digit number)
27062933777009302971…57253398711305935361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.412 × 10¹⁰²(103-digit number)
54125867554018605943…14506797422611870721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.082 × 10¹⁰³(104-digit number)
10825173510803721188…29013594845223741441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.165 × 10¹⁰³(104-digit number)
21650347021607442377…58027189690447482881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.330 × 10¹⁰³(104-digit number)
43300694043214884755…16054379380894965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.660 × 10¹⁰³(104-digit number)
86601388086429769510…32108758761789931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.732 × 10¹⁰⁴(105-digit number)
17320277617285953902…64217517523579863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.464 × 10¹⁰⁴(105-digit number)
34640555234571907804…28435035047159726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.928 × 10¹⁰⁴(105-digit number)
69281110469143815608…56870070094319452161
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,708,821 XPM·at block #6,808,096 · 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