Block #793,869

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/2/2014, 2:11:03 PM · Difficulty 10.9744 · 6,010,953 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21da218e82e97171ce28e3c355ad44fe8e9732b643ef3bb82db8237e214261b4

Height

#793,869

Difficulty

10.974411

Transactions

2

Size

3.16 KB

Version

2

Bits

0af97303

Nonce

616,996,507

Timestamp

11/2/2014, 2:11:03 PM

Confirmations

6,010,953

Merkle Root

ace80e37d387c9f5b50d679bbc3ef848fd09c1fcd8c539c8817f9271e8df88e2
Transactions (2)
1 in → 1 out8.3300 XPM110 B
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.929 × 10⁹⁵(96-digit number)
59298842749811885785…52304296245253836799
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.929 × 10⁹⁵(96-digit number)
59298842749811885785…52304296245253836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.185 × 10⁹⁶(97-digit number)
11859768549962377157…04608592490507673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.371 × 10⁹⁶(97-digit number)
23719537099924754314…09217184981015347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.743 × 10⁹⁶(97-digit number)
47439074199849508628…18434369962030694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.487 × 10⁹⁶(97-digit number)
94878148399699017256…36868739924061388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.897 × 10⁹⁷(98-digit number)
18975629679939803451…73737479848122777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.795 × 10⁹⁷(98-digit number)
37951259359879606902…47474959696245555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.590 × 10⁹⁷(98-digit number)
75902518719759213805…94949919392491110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.518 × 10⁹⁸(99-digit number)
15180503743951842761…89899838784982220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.036 × 10⁹⁸(99-digit number)
30361007487903685522…79799677569964441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.072 × 10⁹⁸(99-digit number)
60722014975807371044…59599355139928883199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,682,646 XPM·at block #6,804,821 · 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.