Block #268,474

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2013, 4:19:14 AM · Difficulty 9.9570 · 6,541,156 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
082b151b3c42db429f201777a935b6d681a8882248765075cc5805ec246acbd7

Height

#268,474

Difficulty

9.957008

Transactions

10

Size

9.44 KB

Version

2

Bits

09f4fe75

Nonce

76,851

Timestamp

11/22/2013, 4:19:14 AM

Confirmations

6,541,156

Merkle Root

fdb77abcb51bd17e867b2828ffccee48eb30ea735569af22aab0c6ee9add1434
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.

8.711 × 10¹⁰³(104-digit number)
87117069253231388537…49520985182724246401
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
8.711 × 10¹⁰³(104-digit number)
87117069253231388537…49520985182724246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.742 × 10¹⁰⁴(105-digit number)
17423413850646277707…99041970365448492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.484 × 10¹⁰⁴(105-digit number)
34846827701292555414…98083940730896985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.969 × 10¹⁰⁴(105-digit number)
69693655402585110829…96167881461793971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.393 × 10¹⁰⁵(106-digit number)
13938731080517022165…92335762923587942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.787 × 10¹⁰⁵(106-digit number)
27877462161034044331…84671525847175884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.575 × 10¹⁰⁵(106-digit number)
55754924322068088663…69343051694351769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.115 × 10¹⁰⁶(107-digit number)
11150984864413617732…38686103388703539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.230 × 10¹⁰⁶(107-digit number)
22301969728827235465…77372206777407078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.460 × 10¹⁰⁶(107-digit number)
44603939457654470930…54744413554814156801
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,721,118 XPM·at block #6,809,629 · 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.

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