Block #842,279

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 12:38:33 PM · Difficulty 10.9737 · 5,968,534 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2fc826ae07848eeadbe11879365b80abf70c4a6a587cf6c0da5ebf496f8dd26d

Height

#842,279

Difficulty

10.973695

Transactions

7

Size

2.25 KB

Version

2

Bits

0af94414

Nonce

1,585,156,651

Timestamp

12/6/2014, 12:38:33 PM

Confirmations

5,968,534

Merkle Root

5967ff20dddb7598caf5d10b50b4cdc949aa96873ecf61cae9216964eaa5a4ef
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.833 × 10⁹⁵(96-digit number)
58335256898014230920…81971731573618662399
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.833 × 10⁹⁵(96-digit number)
58335256898014230920…81971731573618662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.166 × 10⁹⁶(97-digit number)
11667051379602846184…63943463147237324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.333 × 10⁹⁶(97-digit number)
23334102759205692368…27886926294474649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.666 × 10⁹⁶(97-digit number)
46668205518411384736…55773852588949299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.333 × 10⁹⁶(97-digit number)
93336411036822769472…11547705177898598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.866 × 10⁹⁷(98-digit number)
18667282207364553894…23095410355797196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.733 × 10⁹⁷(98-digit number)
37334564414729107788…46190820711594393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.466 × 10⁹⁷(98-digit number)
74669128829458215577…92381641423188787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.493 × 10⁹⁸(99-digit number)
14933825765891643115…84763282846377574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.986 × 10⁹⁸(99-digit number)
29867651531783286231…69526565692755148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.973 × 10⁹⁸(99-digit number)
59735303063566572462…39053131385510297599
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,730,605 XPM·at block #6,810,812 · 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