Block #266,812

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/20/2013, 6:02:14 PM · Difficulty 9.9602 · 6,550,654 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
565ace801ec0d9f8c7d4eb069917272781ec3ec9a7845d64f79a04b65cb22574

Height

#266,812

Difficulty

9.960201

Transactions

7

Size

1.96 KB

Version

2

Bits

09f5cfc3

Nonce

311,083

Timestamp

11/20/2013, 6:02:14 PM

Confirmations

6,550,654

Merkle Root

e74d6164ad5f6ea147dbc416709254b3cef397cb59e8e8d306eb33ce02bb63b5
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.523 × 10⁹⁵(96-digit number)
25238291746251776123…68784887633480664619
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.523 × 10⁹⁵(96-digit number)
25238291746251776123…68784887633480664619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.047 × 10⁹⁵(96-digit number)
50476583492503552247…37569775266961329239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.009 × 10⁹⁶(97-digit number)
10095316698500710449…75139550533922658479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.019 × 10⁹⁶(97-digit number)
20190633397001420898…50279101067845316959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.038 × 10⁹⁶(97-digit number)
40381266794002841797…00558202135690633919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.076 × 10⁹⁶(97-digit number)
80762533588005683595…01116404271381267839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.615 × 10⁹⁷(98-digit number)
16152506717601136719…02232808542762535679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.230 × 10⁹⁷(98-digit number)
32305013435202273438…04465617085525071359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.461 × 10⁹⁷(98-digit number)
64610026870404546876…08931234171050142719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.292 × 10⁹⁸(99-digit number)
12922005374080909375…17862468342100285439
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,783,779 XPM·at block #6,817,465 · 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