Block #320,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 12:34:35 AM · Difficulty 10.1842 · 6,493,268 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e15c4f6b6b59ad0d2ac896d05cd7c9a9b292aad1ba3ac49f9d7bd5fd98f80ab

Height

#320,960

Difficulty

10.184247

Transactions

1

Size

971 B

Version

2

Bits

0a2f2ad8

Nonce

369,638

Timestamp

12/20/2013, 12:34:35 AM

Confirmations

6,493,268

Merkle Root

fa1fcba20a63e96125a1efad7b5e404d0ccfa4ffd19f2bc6c1b412e1f96f8783
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.575 × 10⁹⁹(100-digit number)
65755011758529487937…88256604439857728001
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.575 × 10⁹⁹(100-digit number)
65755011758529487937…88256604439857728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.315 × 10¹⁰⁰(101-digit number)
13151002351705897587…76513208879715456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.630 × 10¹⁰⁰(101-digit number)
26302004703411795174…53026417759430912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.260 × 10¹⁰⁰(101-digit number)
52604009406823590349…06052835518861824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.052 × 10¹⁰¹(102-digit number)
10520801881364718069…12105671037723648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.104 × 10¹⁰¹(102-digit number)
21041603762729436139…24211342075447296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.208 × 10¹⁰¹(102-digit number)
42083207525458872279…48422684150894592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.416 × 10¹⁰¹(102-digit number)
84166415050917744559…96845368301789184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.683 × 10¹⁰²(103-digit number)
16833283010183548911…93690736603578368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.366 × 10¹⁰²(103-digit number)
33666566020367097823…87381473207156736001
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,757,894 XPM·at block #6,814,227 · 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