Block #321,405

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 7:29:37 AM · Difficulty 10.1889 · 6,505,770 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5aa5c978b82de83abfc0faf3a39328cae066b32b5493e9e7935680e15d3b1fe5

Height

#321,405

Difficulty

10.188926

Transactions

13

Size

3.13 KB

Version

2

Bits

0a305d77

Nonce

10,907

Timestamp

12/20/2013, 7:29:37 AM

Confirmations

6,505,770

Merkle Root

8bba7f8715e58abb3064a59891b8c93790a7433fa0330d8ec5df4cc3810f5af8
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.

7.833 × 10⁹¹(92-digit number)
78337480902242301079…47699715063821219841
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
7.833 × 10⁹¹(92-digit number)
78337480902242301079…47699715063821219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.566 × 10⁹²(93-digit number)
15667496180448460215…95399430127642439681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.133 × 10⁹²(93-digit number)
31334992360896920431…90798860255284879361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.266 × 10⁹²(93-digit number)
62669984721793840863…81597720510569758721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.253 × 10⁹³(94-digit number)
12533996944358768172…63195441021139517441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.506 × 10⁹³(94-digit number)
25067993888717536345…26390882042279034881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.013 × 10⁹³(94-digit number)
50135987777435072691…52781764084558069761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.002 × 10⁹⁴(95-digit number)
10027197555487014538…05563528169116139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.005 × 10⁹⁴(95-digit number)
20054395110974029076…11127056338232279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.010 × 10⁹⁴(95-digit number)
40108790221948058152…22254112676464558081
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,861,497 XPM·at block #6,827,174 · 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