Block #333,132

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 1:53:29 PM · Difficulty 10.1633 · 6,483,175 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c23ff655977d19df165e6a29af30a744144db4ea0e002bee701d4f0807ddcfe0

Height

#333,132

Difficulty

10.163250

Transactions

7

Size

1.95 KB

Version

2

Bits

0a29cac5

Nonce

300,029

Timestamp

12/28/2013, 1:53:29 PM

Confirmations

6,483,175

Merkle Root

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

4.748 × 10⁹⁶(97-digit number)
47485092561656736315…57733140503414036481
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
4.748 × 10⁹⁶(97-digit number)
47485092561656736315…57733140503414036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.497 × 10⁹⁶(97-digit number)
94970185123313472631…15466281006828072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.899 × 10⁹⁷(98-digit number)
18994037024662694526…30932562013656145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.798 × 10⁹⁷(98-digit number)
37988074049325389052…61865124027312291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.597 × 10⁹⁷(98-digit number)
75976148098650778105…23730248054624583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.519 × 10⁹⁸(99-digit number)
15195229619730155621…47460496109249167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.039 × 10⁹⁸(99-digit number)
30390459239460311242…94920992218498334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.078 × 10⁹⁸(99-digit number)
60780918478920622484…89841984436996669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.215 × 10⁹⁹(100-digit number)
12156183695784124496…79683968873993338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.431 × 10⁹⁹(100-digit number)
24312367391568248993…59367937747986677761
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,774,576 XPM·at block #6,816,306 · 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