Block #264,195

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/18/2013, 11:30:24 AM · Difficulty 9.9649 · 6,551,790 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7e13783be0abd686dcfd0f48c2af828a419a6967df5c2b4f08dcc8c58c92960

Height

#264,195

Difficulty

9.964933

Transactions

5

Size

1.83 KB

Version

2

Bits

09f705dd

Nonce

14,165

Timestamp

11/18/2013, 11:30:24 AM

Confirmations

6,551,790

Merkle Root

dc75dba80db5844dcfb299400e336065afd16976a4e4a72487479dd888008c9c
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.027 × 10⁹⁸(99-digit number)
20277402491608727796…80728392761597239041
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.027 × 10⁹⁸(99-digit number)
20277402491608727796…80728392761597239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.055 × 10⁹⁸(99-digit number)
40554804983217455593…61456785523194478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.110 × 10⁹⁸(99-digit number)
81109609966434911187…22913571046388956161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.622 × 10⁹⁹(100-digit number)
16221921993286982237…45827142092777912321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.244 × 10⁹⁹(100-digit number)
32443843986573964474…91654284185555824641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.488 × 10⁹⁹(100-digit number)
64887687973147928949…83308568371111649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.297 × 10¹⁰⁰(101-digit number)
12977537594629585789…66617136742223298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.595 × 10¹⁰⁰(101-digit number)
25955075189259171579…33234273484446597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.191 × 10¹⁰⁰(101-digit number)
51910150378518343159…66468546968893194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.038 × 10¹⁰¹(102-digit number)
10382030075703668631…32937093937786388481
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,771,994 XPM·at block #6,815,984 · 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