Block #788,251

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/29/2014, 4:00:48 PM · Difficulty 10.9744 · 6,020,623 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1b69acfb7ca594468dc27f35d954404888c75195aaf79b84f12785f43e4602cf

Height

#788,251

Difficulty

10.974372

Transactions

4

Size

885 B

Version

2

Bits

0af9706a

Nonce

124,707,822

Timestamp

10/29/2014, 4:00:48 PM

Confirmations

6,020,623

Merkle Root

f0d39f48d0c22bfadcd1641c9a6a0d56e685e6519bcb99a3951dbc2c67eb079f
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.136 × 10⁹⁷(98-digit number)
11364888574557048850…74003720545024639999
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.136 × 10⁹⁷(98-digit number)
11364888574557048850…74003720545024639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.272 × 10⁹⁷(98-digit number)
22729777149114097700…48007441090049279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.545 × 10⁹⁷(98-digit number)
45459554298228195400…96014882180098559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.091 × 10⁹⁷(98-digit number)
90919108596456390801…92029764360197119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.818 × 10⁹⁸(99-digit number)
18183821719291278160…84059528720394239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.636 × 10⁹⁸(99-digit number)
36367643438582556320…68119057440788479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.273 × 10⁹⁸(99-digit number)
72735286877165112641…36238114881576959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.454 × 10⁹⁹(100-digit number)
14547057375433022528…72476229763153919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.909 × 10⁹⁹(100-digit number)
29094114750866045056…44952459526307839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.818 × 10⁹⁹(100-digit number)
58188229501732090113…89904919052615679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.163 × 10¹⁰⁰(101-digit number)
11637645900346418022…79809838105231359999
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,715,042 XPM·at block #6,808,873 · 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