Block #275,235

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 3:01:22 PM · Difficulty 9.9602 · 6,535,673 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1f1ae64ecccd6f5f01211f957d5e148e1aaae30942307e4148ba74dfd90b43fc

Height

#275,235

Difficulty

9.960167

Transactions

3

Size

35.47 KB

Version

2

Bits

09f5cd82

Nonce

102,518

Timestamp

11/26/2013, 3:01:22 PM

Confirmations

6,535,673

Merkle Root

0d75f8edfd76e1f4e1ee2cf1ee3e879acfd0331d3c642e99e1aeca4b9b054116
Transactions (3)
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.171 × 10⁸⁹(90-digit number)
21710421270968016053…02012350896114559111
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.171 × 10⁸⁹(90-digit number)
21710421270968016053…02012350896114559111
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.342 × 10⁸⁹(90-digit number)
43420842541936032106…04024701792229118221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.684 × 10⁸⁹(90-digit number)
86841685083872064212…08049403584458236441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.736 × 10⁹⁰(91-digit number)
17368337016774412842…16098807168916472881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.473 × 10⁹⁰(91-digit number)
34736674033548825685…32197614337832945761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.947 × 10⁹⁰(91-digit number)
69473348067097651370…64395228675665891521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.389 × 10⁹¹(92-digit number)
13894669613419530274…28790457351331783041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.778 × 10⁹¹(92-digit number)
27789339226839060548…57580914702663566081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.557 × 10⁹¹(92-digit number)
55578678453678121096…15161829405327132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.111 × 10⁹²(93-digit number)
11115735690735624219…30323658810654264321
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,731,364 XPM·at block #6,810,907 · 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