Block #804,309

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/9/2014, 6:25:04 PM · Difficulty 10.9753 · 6,012,946 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7a18d13504f5fd741b71ba82faeebe33cbfce27bf043c45ae3ad0ac90715f1d

Height

#804,309

Difficulty

10.975289

Transactions

6

Size

1.45 KB

Version

2

Bits

0af9ac85

Nonce

546,813,043

Timestamp

11/9/2014, 6:25:04 PM

Confirmations

6,012,946

Merkle Root

33e9480556f4ffaa810a9121af4550b408f431b5322855d7af0579a86a158c15
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.

4.467 × 10⁹⁶(97-digit number)
44675679625527096508…51472543441030340801
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
4.467 × 10⁹⁶(97-digit number)
44675679625527096508…51472543441030340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.935 × 10⁹⁶(97-digit number)
89351359251054193017…02945086882060681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.787 × 10⁹⁷(98-digit number)
17870271850210838603…05890173764121363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.574 × 10⁹⁷(98-digit number)
35740543700421677207…11780347528242726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.148 × 10⁹⁷(98-digit number)
71481087400843354414…23560695056485452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.429 × 10⁹⁸(99-digit number)
14296217480168670882…47121390112970905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.859 × 10⁹⁸(99-digit number)
28592434960337341765…94242780225941811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.718 × 10⁹⁸(99-digit number)
57184869920674683531…88485560451883622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.143 × 10⁹⁹(100-digit number)
11436973984134936706…76971120903767244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.287 × 10⁹⁹(100-digit number)
22873947968269873412…53942241807534489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.574 × 10⁹⁹(100-digit number)
45747895936539746824…07884483615068979201
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,782,075 XPM·at block #6,817,254 · 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