Block #838,309

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2014, 1:43:37 PM · Difficulty 10.9750 · 5,976,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6375b2678786eb38d353dc3c62b529906e2a3987e13030b1bb075ebfde7d05c

Height

#838,309

Difficulty

10.975017

Transactions

10

Size

2.91 KB

Version

2

Bits

0af99aba

Nonce

849,431,119

Timestamp

12/3/2014, 1:43:37 PM

Confirmations

5,976,001

Merkle Root

5fe1d8f33736f7085e9742fae736a122887d90bb10bd856cebc686d913b54417
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.526 × 10⁹⁶(97-digit number)
15263797435633220938…04554630921747196479
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.526 × 10⁹⁶(97-digit number)
15263797435633220938…04554630921747196479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.052 × 10⁹⁶(97-digit number)
30527594871266441876…09109261843494392959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.105 × 10⁹⁶(97-digit number)
61055189742532883752…18218523686988785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.221 × 10⁹⁷(98-digit number)
12211037948506576750…36437047373977571839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.442 × 10⁹⁷(98-digit number)
24422075897013153501…72874094747955143679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.884 × 10⁹⁷(98-digit number)
48844151794026307002…45748189495910287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.768 × 10⁹⁷(98-digit number)
97688303588052614004…91496378991820574719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.953 × 10⁹⁸(99-digit number)
19537660717610522800…82992757983641149439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.907 × 10⁹⁸(99-digit number)
39075321435221045601…65985515967282298879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.815 × 10⁹⁸(99-digit number)
78150642870442091203…31971031934564597759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.563 × 10⁹⁹(100-digit number)
15630128574088418240…63942063869129195519
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,758,542 XPM·at block #6,814,309 · 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