Block #2,844,354

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2018, 4:10:25 AM · Difficulty 11.7287 · 3,997,899 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f24fcbe27fd0fe4f82a955b48e178bac20e135e9dec4fc7c940538df270662c3

Height

#2,844,354

Difficulty

11.728692

Transactions

3

Size

10.03 KB

Version

2

Bits

0bba8b93

Nonce

30,468,850

Timestamp

9/18/2018, 4:10:25 AM

Confirmations

3,997,899

Merkle Root

ddb242300e9c15fb1ec178052d7f68f7058b816a1eb2b63c0bbda6555eb628ee
Transactions (3)
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.964 × 10⁹⁵(96-digit number)
39643629609207993351…77591140837723137279
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.964 × 10⁹⁵(96-digit number)
39643629609207993351…77591140837723137279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.928 × 10⁹⁵(96-digit number)
79287259218415986702…55182281675446274559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.585 × 10⁹⁶(97-digit number)
15857451843683197340…10364563350892549119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.171 × 10⁹⁶(97-digit number)
31714903687366394680…20729126701785098239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.342 × 10⁹⁶(97-digit number)
63429807374732789361…41458253403570196479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.268 × 10⁹⁷(98-digit number)
12685961474946557872…82916506807140392959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.537 × 10⁹⁷(98-digit number)
25371922949893115744…65833013614280785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.074 × 10⁹⁷(98-digit number)
50743845899786231489…31666027228561571839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.014 × 10⁹⁸(99-digit number)
10148769179957246297…63332054457123143679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.029 × 10⁹⁸(99-digit number)
20297538359914492595…26664108914246287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.059 × 10⁹⁸(99-digit number)
40595076719828985191…53328217828492574719
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,982,421 XPM·at block #6,842,252 · 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