Block #333,640

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 10:44:13 PM · Difficulty 10.1595 · 6,480,750 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
85e97d0a762e2aaece2bab914bd86e42258fc76a83dc1d7f8ea0ce08645277e1

Height

#333,640

Difficulty

10.159509

Transactions

5

Size

1.08 KB

Version

2

Bits

0a28d59a

Nonce

19,947

Timestamp

12/28/2013, 10:44:13 PM

Confirmations

6,480,750

Merkle Root

5a202d20bbd7a519af37f405960c142d96a8c578fc9d06b05fa38bda2358a5cb
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.767 × 10¹⁰⁰(101-digit number)
77673054479198311950…67628853439007093761
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.767 × 10¹⁰⁰(101-digit number)
77673054479198311950…67628853439007093761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.553 × 10¹⁰¹(102-digit number)
15534610895839662390…35257706878014187521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.106 × 10¹⁰¹(102-digit number)
31069221791679324780…70515413756028375041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.213 × 10¹⁰¹(102-digit number)
62138443583358649560…41030827512056750081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.242 × 10¹⁰²(103-digit number)
12427688716671729912…82061655024113500161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.485 × 10¹⁰²(103-digit number)
24855377433343459824…64123310048227000321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.971 × 10¹⁰²(103-digit number)
49710754866686919648…28246620096454000641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.942 × 10¹⁰²(103-digit number)
99421509733373839296…56493240192908001281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.988 × 10¹⁰³(104-digit number)
19884301946674767859…12986480385816002561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.976 × 10¹⁰³(104-digit number)
39768603893349535718…25972960771632005121
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,759,181 XPM·at block #6,814,389 · 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