Block #301,272

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 2:34:56 AM · Difficulty 9.9925 · 6,514,946 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9956bfe1dd89cfe719ed7dd21fc27797b786e4ec9ebf5e9d463a3e75865a9f0

Height

#301,272

Difficulty

9.992477

Transactions

11

Size

2.83 KB

Version

2

Bits

09fe12f4

Nonce

15,616

Timestamp

12/9/2013, 2:34:56 AM

Confirmations

6,514,946

Merkle Root

932bc58abd34286e49a2449ddb8ffabe5cd3137b4eeaf6029da367b79a7d4d12
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.055 × 10⁹¹(92-digit number)
10556970963772906301…79153284487105192961
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.055 × 10⁹¹(92-digit number)
10556970963772906301…79153284487105192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.111 × 10⁹¹(92-digit number)
21113941927545812602…58306568974210385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.222 × 10⁹¹(92-digit number)
42227883855091625204…16613137948420771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.445 × 10⁹¹(92-digit number)
84455767710183250408…33226275896841543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.689 × 10⁹²(93-digit number)
16891153542036650081…66452551793683087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.378 × 10⁹²(93-digit number)
33782307084073300163…32905103587366174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.756 × 10⁹²(93-digit number)
67564614168146600327…65810207174732349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.351 × 10⁹³(94-digit number)
13512922833629320065…31620414349464698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.702 × 10⁹³(94-digit number)
27025845667258640130…63240828698929397761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.405 × 10⁹³(94-digit number)
54051691334517280261…26481657397858795521
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,773,873 XPM·at block #6,816,217 · 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