Block #365,867

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2014, 1:25:18 AM · Difficulty 10.4243 · 6,445,112 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
14659944aadda844e0b34e3a8facd4ccaf6abe5e684e28db0e17400849e21c93

Height

#365,867

Difficulty

10.424316

Transactions

6

Size

10.98 KB

Version

2

Bits

0a6c9ffb

Nonce

84,829

Timestamp

1/19/2014, 1:25:18 AM

Confirmations

6,445,112

Merkle Root

235bfee7ffdf3fc753b98b566adfe097fd1e5f3db8103a88e115a9ffaeef6b7b
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.

6.574 × 10⁹⁸(99-digit number)
65745524481801203760…83123153658815200441
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
6.574 × 10⁹⁸(99-digit number)
65745524481801203760…83123153658815200441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.314 × 10⁹⁹(100-digit number)
13149104896360240752…66246307317630400881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.629 × 10⁹⁹(100-digit number)
26298209792720481504…32492614635260801761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.259 × 10⁹⁹(100-digit number)
52596419585440963008…64985229270521603521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.051 × 10¹⁰⁰(101-digit number)
10519283917088192601…29970458541043207041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.103 × 10¹⁰⁰(101-digit number)
21038567834176385203…59940917082086414081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.207 × 10¹⁰⁰(101-digit number)
42077135668352770406…19881834164172828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.415 × 10¹⁰⁰(101-digit number)
84154271336705540813…39763668328345656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.683 × 10¹⁰¹(102-digit number)
16830854267341108162…79527336656691312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.366 × 10¹⁰¹(102-digit number)
33661708534682216325…59054673313382625281
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,731,935 XPM·at block #6,810,978 · 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