Block #826,469

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/24/2014, 10:02:37 PM · Difficulty 10.9775 · 5,984,517 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f9fe394174a1c99fed3a61c502e2505a404d702eb28379e19b34d99debec8377

Height

#826,469

Difficulty

10.977545

Transactions

9

Size

3.20 KB

Version

2

Bits

0afa4066

Nonce

404,035,536

Timestamp

11/24/2014, 10:02:37 PM

Confirmations

5,984,517

Merkle Root

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

3.370 × 10⁹⁶(97-digit number)
33709294138397120675…86110062881462173119
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
3.370 × 10⁹⁶(97-digit number)
33709294138397120675…86110062881462173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.741 × 10⁹⁶(97-digit number)
67418588276794241351…72220125762924346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.348 × 10⁹⁷(98-digit number)
13483717655358848270…44440251525848692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.696 × 10⁹⁷(98-digit number)
26967435310717696540…88880503051697384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.393 × 10⁹⁷(98-digit number)
53934870621435393080…77761006103394769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.078 × 10⁹⁸(99-digit number)
10786974124287078616…55522012206789539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.157 × 10⁹⁸(99-digit number)
21573948248574157232…11044024413579079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.314 × 10⁹⁸(99-digit number)
43147896497148314464…22088048827158159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.629 × 10⁹⁸(99-digit number)
86295792994296628929…44176097654316318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.725 × 10⁹⁹(100-digit number)
17259158598859325785…88352195308632637439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.451 × 10⁹⁹(100-digit number)
34518317197718651571…76704390617265274879
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,731,991 XPM·at block #6,810,985 · 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