Block #832,278

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2014, 7:01:49 PM · Difficulty 10.9787 · 6,010,305 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0c83e8793dff776927ca91733d567c6c7750b75bc864a68006453ddc8146fd6c

Height

#832,278

Difficulty

10.978732

Transactions

2

Size

877 B

Version

2

Bits

0afa8e2f

Nonce

1,228,354,505

Timestamp

11/28/2014, 7:01:49 PM

Confirmations

6,010,305

Merkle Root

62705c7e95c1f1d7550fb9bb1a00bf7b2aa09d2ad7633c0c33ecfb7665302e36
Transactions (2)
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.123 × 10⁹⁵(96-digit number)
11237596958296082031…80243646131961375201
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.123 × 10⁹⁵(96-digit number)
11237596958296082031…80243646131961375201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.247 × 10⁹⁵(96-digit number)
22475193916592164063…60487292263922750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.495 × 10⁹⁵(96-digit number)
44950387833184328126…20974584527845500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.990 × 10⁹⁵(96-digit number)
89900775666368656253…41949169055691001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.798 × 10⁹⁶(97-digit number)
17980155133273731250…83898338111382003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.596 × 10⁹⁶(97-digit number)
35960310266547462501…67796676222764006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.192 × 10⁹⁶(97-digit number)
71920620533094925002…35593352445528012801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.438 × 10⁹⁷(98-digit number)
14384124106618985000…71186704891056025601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.876 × 10⁹⁷(98-digit number)
28768248213237970000…42373409782112051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.753 × 10⁹⁷(98-digit number)
57536496426475940001…84746819564224102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.150 × 10⁹⁸(99-digit number)
11507299285295188000…69493639128448204801
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,985,092 XPM·at block #6,842,582 · 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