Block #270,513

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/24/2013, 12:16:11 AM · Difficulty 9.9517 · 6,546,269 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13f4e53dbc0552a697dbcf7bd0d05a2ce1087844ad68d742b7645842d6e39835

Height

#270,513

Difficulty

9.951672

Transactions

5

Size

1.26 KB

Version

2

Bits

09f3a0c6

Nonce

18,488

Timestamp

11/24/2013, 12:16:11 AM

Confirmations

6,546,269

Merkle Root

691c3725ea9a054548a0745abc2e08310809274d30802dadc8542df5100d13f7
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.790 × 10¹⁰⁴(105-digit number)
17908771112915687843…75899080882796326401
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.790 × 10¹⁰⁴(105-digit number)
17908771112915687843…75899080882796326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.581 × 10¹⁰⁴(105-digit number)
35817542225831375686…51798161765592652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.163 × 10¹⁰⁴(105-digit number)
71635084451662751372…03596323531185305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.432 × 10¹⁰⁵(106-digit number)
14327016890332550274…07192647062370611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.865 × 10¹⁰⁵(106-digit number)
28654033780665100549…14385294124741222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.730 × 10¹⁰⁵(106-digit number)
57308067561330201098…28770588249482444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.146 × 10¹⁰⁶(107-digit number)
11461613512266040219…57541176498964889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.292 × 10¹⁰⁶(107-digit number)
22923227024532080439…15082352997929779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.584 × 10¹⁰⁶(107-digit number)
45846454049064160878…30164705995859558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.169 × 10¹⁰⁶(107-digit number)
91692908098128321757…60329411991719116801
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,778,291 XPM·at block #6,816,781 · 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