Block #736,817

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/23/2014, 8:45:40 AM · Difficulty 10.9767 · 6,076,002 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
782ac11b4222828f8e15e61023700837b83be33365808d25271d7983d7c8677b

Height

#736,817

Difficulty

10.976742

Transactions

8

Size

2.04 KB

Version

2

Bits

0afa0bc4

Nonce

1,773,790,365

Timestamp

9/23/2014, 8:45:40 AM

Confirmations

6,076,002

Merkle Root

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

5.651 × 10⁹⁶(97-digit number)
56510061970030335776…13635016506689756161
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
5.651 × 10⁹⁶(97-digit number)
56510061970030335776…13635016506689756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.130 × 10⁹⁷(98-digit number)
11302012394006067155…27270033013379512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.260 × 10⁹⁷(98-digit number)
22604024788012134310…54540066026759024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.520 × 10⁹⁷(98-digit number)
45208049576024268621…09080132053518049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.041 × 10⁹⁷(98-digit number)
90416099152048537242…18160264107036098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.808 × 10⁹⁸(99-digit number)
18083219830409707448…36320528214072197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.616 × 10⁹⁸(99-digit number)
36166439660819414897…72641056428144394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.233 × 10⁹⁸(99-digit number)
72332879321638829794…45282112856288788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.446 × 10⁹⁹(100-digit number)
14466575864327765958…90564225712577576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.893 × 10⁹⁹(100-digit number)
28933151728655531917…81128451425155153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.786 × 10⁹⁹(100-digit number)
57866303457311063835…62256902850310307841
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,746,598 XPM·at block #6,812,818 · 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