Block #265,427

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2013, 1:31:42 PM · Difficulty 9.9626 · 6,574,324 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77ea78fab9e91b35ce6b349c7ffeafd87f9a1deabc3e5eb574e3aa9cc4b55129

Height

#265,427

Difficulty

9.962620

Transactions

4

Size

1.18 KB

Version

2

Bits

09f66e49

Nonce

32,633

Timestamp

11/19/2013, 1:31:42 PM

Confirmations

6,574,324

Merkle Root

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

1.044 × 10⁹⁷(98-digit number)
10444345032065519071…66748300071416192001
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
1.044 × 10⁹⁷(98-digit number)
10444345032065519071…66748300071416192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.088 × 10⁹⁷(98-digit number)
20888690064131038143…33496600142832384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.177 × 10⁹⁷(98-digit number)
41777380128262076286…66993200285664768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.355 × 10⁹⁷(98-digit number)
83554760256524152572…33986400571329536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.671 × 10⁹⁸(99-digit number)
16710952051304830514…67972801142659072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.342 × 10⁹⁸(99-digit number)
33421904102609661028…35945602285318144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.684 × 10⁹⁸(99-digit number)
66843808205219322057…71891204570636288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.336 × 10⁹⁹(100-digit number)
13368761641043864411…43782409141272576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.673 × 10⁹⁹(100-digit number)
26737523282087728823…87564818282545152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.347 × 10⁹⁹(100-digit number)
53475046564175457646…75129636565090304001
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,962,294 XPM·at block #6,839,750 · 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