Block #260,728

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/14/2013, 4:50:26 PM · Difficulty 9.9762 · 6,557,040 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
95afeba0f5746045e01c70ba2307ebbc17795a75a70885135a6c85b75d73be2c

Height

#260,728

Difficulty

9.976224

Transactions

4

Size

16.75 KB

Version

2

Bits

09f9e9cc

Nonce

192,153

Timestamp

11/14/2013, 4:50:26 PM

Confirmations

6,557,040

Merkle Root

76c92288d3cc1a4dd7a0034d6f13983de031c333c36459b3b61bde4cafee5a7f
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.270 × 10⁹⁶(97-digit number)
22701145241093036093…17670397158689536641
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.270 × 10⁹⁶(97-digit number)
22701145241093036093…17670397158689536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.540 × 10⁹⁶(97-digit number)
45402290482186072187…35340794317379073281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.080 × 10⁹⁶(97-digit number)
90804580964372144375…70681588634758146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.816 × 10⁹⁷(98-digit number)
18160916192874428875…41363177269516293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.632 × 10⁹⁷(98-digit number)
36321832385748857750…82726354539032586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.264 × 10⁹⁷(98-digit number)
72643664771497715500…65452709078065172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.452 × 10⁹⁸(99-digit number)
14528732954299543100…30905418156130344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.905 × 10⁹⁸(99-digit number)
29057465908599086200…61810836312260689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.811 × 10⁹⁸(99-digit number)
58114931817198172400…23621672624521379841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.162 × 10⁹⁹(100-digit number)
11622986363439634480…47243345249042759681
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,786,201 XPM·at block #6,817,767 · 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