Block #269,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/23/2013, 2:26:05 PM · Difficulty 9.9520 · 6,544,081 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
99a4d46579ea1d1f6998745145c8bb1497e487580f7b45c1b05c39d9998043a5

Height

#269,960

Difficulty

9.951996

Transactions

7

Size

9.03 KB

Version

2

Bits

09f3b5fb

Nonce

168,117

Timestamp

11/23/2013, 2:26:05 PM

Confirmations

6,544,081

Merkle Root

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

6.634 × 10⁹¹(92-digit number)
66344530776700148784…94419936647963523001
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
6.634 × 10⁹¹(92-digit number)
66344530776700148784…94419936647963523001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.326 × 10⁹²(93-digit number)
13268906155340029756…88839873295927046001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.653 × 10⁹²(93-digit number)
26537812310680059513…77679746591854092001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.307 × 10⁹²(93-digit number)
53075624621360119027…55359493183708184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.061 × 10⁹³(94-digit number)
10615124924272023805…10718986367416368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.123 × 10⁹³(94-digit number)
21230249848544047611…21437972734832736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.246 × 10⁹³(94-digit number)
42460499697088095222…42875945469665472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.492 × 10⁹³(94-digit number)
84920999394176190444…85751890939330944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.698 × 10⁹⁴(95-digit number)
16984199878835238088…71503781878661888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.396 × 10⁹⁴(95-digit number)
33968399757670476177…43007563757323776001
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,756,403 XPM·at block #6,814,040 · 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