Block #332,027

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 6:18:04 PM · Difficulty 10.1746 · 6,485,977 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
426fe0c709766b27d673e9418e24204378c8d49204fe898d4a0bd0997a682605

Height

#332,027

Difficulty

10.174557

Transactions

13

Size

3.57 KB

Version

2

Bits

0a2cafca

Nonce

301,780

Timestamp

12/27/2013, 6:18:04 PM

Confirmations

6,485,977

Merkle Root

216521cc9eeaa2cf3104b0dccf5b4b93856b123ead2991d6eeabbc232b1fafcb
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.575 × 10⁹⁷(98-digit number)
15755596142810026364…20434800573355443201
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.575 × 10⁹⁷(98-digit number)
15755596142810026364…20434800573355443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.151 × 10⁹⁷(98-digit number)
31511192285620052729…40869601146710886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.302 × 10⁹⁷(98-digit number)
63022384571240105458…81739202293421772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.260 × 10⁹⁸(99-digit number)
12604476914248021091…63478404586843545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.520 × 10⁹⁸(99-digit number)
25208953828496042183…26956809173687091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.041 × 10⁹⁸(99-digit number)
50417907656992084366…53913618347374182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.008 × 10⁹⁹(100-digit number)
10083581531398416873…07827236694748364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.016 × 10⁹⁹(100-digit number)
20167163062796833746…15654473389496729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.033 × 10⁹⁹(100-digit number)
40334326125593667493…31308946778993459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.066 × 10⁹⁹(100-digit number)
80668652251187334986…62617893557986918401
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,788,097 XPM·at block #6,818,003 · 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