Block #791,337

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/31/2014, 11:27:51 PM · Difficulty 10.9732 · 6,016,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f050e7a15a5a141823af98d72f26990c83b0039a07bbff99b0a014bfc6b49441

Height

#791,337

Difficulty

10.973250

Transactions

10

Size

2.77 KB

Version

2

Bits

0af926e7

Nonce

55,617,666

Timestamp

10/31/2014, 11:27:51 PM

Confirmations

6,016,801

Merkle Root

2826ad9a6a2e3f99dd2917e34c88c5d95b929fca1ffb38e7713743526a277be2
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.039 × 10⁹⁶(97-digit number)
10392099358316004510…46404122451173322081
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.039 × 10⁹⁶(97-digit number)
10392099358316004510…46404122451173322081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.078 × 10⁹⁶(97-digit number)
20784198716632009021…92808244902346644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.156 × 10⁹⁶(97-digit number)
41568397433264018042…85616489804693288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.313 × 10⁹⁶(97-digit number)
83136794866528036085…71232979609386576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.662 × 10⁹⁷(98-digit number)
16627358973305607217…42465959218773153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.325 × 10⁹⁷(98-digit number)
33254717946611214434…84931918437546306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.650 × 10⁹⁷(98-digit number)
66509435893222428868…69863836875092613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.330 × 10⁹⁸(99-digit number)
13301887178644485773…39727673750185226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.660 × 10⁹⁸(99-digit number)
26603774357288971547…79455347500370452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.320 × 10⁹⁸(99-digit number)
53207548714577943094…58910695000740904961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.064 × 10⁹⁹(100-digit number)
10641509742915588618…17821390001481809921
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,709,146 XPM·at block #6,808,137 · 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.

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