Block #276,248

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 2:22:27 AM · Difficulty 9.9627 · 6,534,776 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c760813786525a1f9272c4a8912cd0954ca06201593560458e4a30a4e1e5bb19

Height

#276,248

Difficulty

9.962733

Transactions

4

Size

1.31 KB

Version

2

Bits

09f675a5

Nonce

4,246

Timestamp

11/27/2013, 2:22:27 AM

Confirmations

6,534,776

Merkle Root

a5389af867300c942111d3dd10b6a936619f6c31bcefb1efa8600c064e39a94b
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.100 × 10¹⁰⁴(105-digit number)
21006268198814005821…46798941659426466561
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.100 × 10¹⁰⁴(105-digit number)
21006268198814005821…46798941659426466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.201 × 10¹⁰⁴(105-digit number)
42012536397628011642…93597883318852933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.402 × 10¹⁰⁴(105-digit number)
84025072795256023285…87195766637705866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.680 × 10¹⁰⁵(106-digit number)
16805014559051204657…74391533275411732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.361 × 10¹⁰⁵(106-digit number)
33610029118102409314…48783066550823464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.722 × 10¹⁰⁵(106-digit number)
67220058236204818628…97566133101646929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.344 × 10¹⁰⁶(107-digit number)
13444011647240963725…95132266203293859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.688 × 10¹⁰⁶(107-digit number)
26888023294481927451…90264532406587719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.377 × 10¹⁰⁶(107-digit number)
53776046588963854902…80529064813175439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.075 × 10¹⁰⁷(108-digit number)
10755209317792770980…61058129626350878721
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,732,299 XPM·at block #6,811,023 · 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