Block #263,755

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/18/2013, 2:37:07 AM · Difficulty 9.9656 · 6,544,360 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1112e854680dfb720e785f4c1462535bd488bf22e29b5dc2f2fe3d42ade10525

Height

#263,755

Difficulty

9.965560

Transactions

5

Size

1.48 KB

Version

2

Bits

09f72eed

Nonce

15,612

Timestamp

11/18/2013, 2:37:07 AM

Confirmations

6,544,360

Merkle Root

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

7.175 × 10⁸⁹(90-digit number)
71759291876003648350…85198200715291524281
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
7.175 × 10⁸⁹(90-digit number)
71759291876003648350…85198200715291524281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.435 × 10⁹⁰(91-digit number)
14351858375200729670…70396401430583048561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.870 × 10⁹⁰(91-digit number)
28703716750401459340…40792802861166097121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.740 × 10⁹⁰(91-digit number)
57407433500802918680…81585605722332194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.148 × 10⁹¹(92-digit number)
11481486700160583736…63171211444664388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.296 × 10⁹¹(92-digit number)
22962973400321167472…26342422889328776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.592 × 10⁹¹(92-digit number)
45925946800642334944…52684845778657553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.185 × 10⁹¹(92-digit number)
91851893601284669888…05369691557315107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.837 × 10⁹²(93-digit number)
18370378720256933977…10739383114630215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.674 × 10⁹²(93-digit number)
36740757440513867955…21478766229260431361
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,708,968 XPM·at block #6,808,114 · 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