Block #462,327

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2014, 9:11:19 AM · Difficulty 10.4100 · 6,379,971 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e646cc143b939286e81a880c20666298f1e2a0c08f20e005dc858591df07466a

Height

#462,327

Difficulty

10.409965

Transactions

1

Size

936 B

Version

2

Bits

0a68f372

Nonce

19,831

Timestamp

3/27/2014, 9:11:19 AM

Confirmations

6,379,971

Merkle Root

88a312dd4666110bb18838ffa661076d4d8ef711769c4770f88422f3223ba13e
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.111 × 10⁹⁶(97-digit number)
21114661757594629460…97512638125615425351
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.111 × 10⁹⁶(97-digit number)
21114661757594629460…97512638125615425351
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.222 × 10⁹⁶(97-digit number)
42229323515189258921…95025276251230850701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.445 × 10⁹⁶(97-digit number)
84458647030378517842…90050552502461701401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.689 × 10⁹⁷(98-digit number)
16891729406075703568…80101105004923402801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.378 × 10⁹⁷(98-digit number)
33783458812151407136…60202210009846805601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.756 × 10⁹⁷(98-digit number)
67566917624302814273…20404420019693611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.351 × 10⁹⁸(99-digit number)
13513383524860562854…40808840039387222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.702 × 10⁹⁸(99-digit number)
27026767049721125709…81617680078774444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.405 × 10⁹⁸(99-digit number)
54053534099442251419…63235360157548889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.081 × 10⁹⁹(100-digit number)
10810706819888450283…26470720315097779201
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,982,788 XPM·at block #6,842,297 · 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