Block #2,642,842

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 9:27:28 PM · Difficulty 11.6654 · 4,189,864 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1181dae5f15d79cb30f61f321b607dde49d092628e5e253241290433a500f63

Height

#2,642,842

Difficulty

11.665395

Transactions

5

Size

1.37 KB

Version

2

Bits

0baa5759

Nonce

998,564,080

Timestamp

5/1/2018, 9:27:28 PM

Confirmations

4,189,864

Merkle Root

81a271e951f3bc8f2d240fe56ceed9d713bb48304f5f17bbc7ab90b285b2627c
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.

7.242 × 10⁹⁶(97-digit number)
72424622559413167716…54866750349020159999
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
7.242 × 10⁹⁶(97-digit number)
72424622559413167716…54866750349020159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.448 × 10⁹⁷(98-digit number)
14484924511882633543…09733500698040319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.896 × 10⁹⁷(98-digit number)
28969849023765267086…19467001396080639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.793 × 10⁹⁷(98-digit number)
57939698047530534173…38934002792161279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.158 × 10⁹⁸(99-digit number)
11587939609506106834…77868005584322559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.317 × 10⁹⁸(99-digit number)
23175879219012213669…55736011168645119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.635 × 10⁹⁸(99-digit number)
46351758438024427338…11472022337290239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.270 × 10⁹⁸(99-digit number)
92703516876048854677…22944044674580479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.854 × 10⁹⁹(100-digit number)
18540703375209770935…45888089349160959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.708 × 10⁹⁹(100-digit number)
37081406750419541870…91776178698321919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.416 × 10⁹⁹(100-digit number)
74162813500839083741…83552357396643839999
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,905,806 XPM·at block #6,832,705 · 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