Block #265,303

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2013, 10:48:17 AM · Difficulty 9.9629 · 6,545,336 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5802bf58e50e6df66d25825071517f2e0290d4ecdbbd16942e25857f260c750b

Height

#265,303

Difficulty

9.962930

Transactions

8

Size

4.82 KB

Version

2

Bits

09f6828d

Nonce

4,006

Timestamp

11/19/2013, 10:48:17 AM

Confirmations

6,545,336

Merkle Root

5ea0f2ac5cd876d7458e746102ffcdeccfbf53c88e89baadf3c908dc368bfd47
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.

5.064 × 10⁹⁴(95-digit number)
50646693747758163928…38772468803119234561
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
5.064 × 10⁹⁴(95-digit number)
50646693747758163928…38772468803119234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.012 × 10⁹⁵(96-digit number)
10129338749551632785…77544937606238469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.025 × 10⁹⁵(96-digit number)
20258677499103265571…55089875212476938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.051 × 10⁹⁵(96-digit number)
40517354998206531142…10179750424953876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.103 × 10⁹⁵(96-digit number)
81034709996413062285…20359500849907752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.620 × 10⁹⁶(97-digit number)
16206941999282612457…40719001699815505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.241 × 10⁹⁶(97-digit number)
32413883998565224914…81438003399631011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.482 × 10⁹⁶(97-digit number)
64827767997130449828…62876006799262023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.296 × 10⁹⁷(98-digit number)
12965553599426089965…25752013598524047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.593 × 10⁹⁷(98-digit number)
25931107198852179931…51504027197048094721
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,729,200 XPM·at block #6,810,638 · 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