Block #331,832

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 3:10:01 PM · Difficulty 10.1728 · 6,485,626 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
edd9bbc6786cf6afc7e803274d3309772abb25c58343157e52e98544c2524b6a

Height

#331,832

Difficulty

10.172822

Transactions

4

Size

1.74 KB

Version

2

Bits

0a2c3e09

Nonce

6,619

Timestamp

12/27/2013, 3:10:01 PM

Confirmations

6,485,626

Merkle Root

a47020ced55e9a5b886560681bdb28058755fcfba18e84cd3fc5481e0258d44c
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.501 × 10⁹⁶(97-digit number)
15011338660325674446…73421615644656330001
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.501 × 10⁹⁶(97-digit number)
15011338660325674446…73421615644656330001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.002 × 10⁹⁶(97-digit number)
30022677320651348892…46843231289312660001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.004 × 10⁹⁶(97-digit number)
60045354641302697784…93686462578625320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.200 × 10⁹⁷(98-digit number)
12009070928260539556…87372925157250640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.401 × 10⁹⁷(98-digit number)
24018141856521079113…74745850314501280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.803 × 10⁹⁷(98-digit number)
48036283713042158227…49491700629002560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.607 × 10⁹⁷(98-digit number)
96072567426084316454…98983401258005120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.921 × 10⁹⁸(99-digit number)
19214513485216863290…97966802516010240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.842 × 10⁹⁸(99-digit number)
38429026970433726581…95933605032020480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.685 × 10⁹⁸(99-digit number)
76858053940867453163…91867210064040960001
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,783,714 XPM·at block #6,817,457 · 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