Block #2,838,898

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2018, 11:37:32 AM · Difficulty 11.7207 · 4,005,933 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
794e21e1226e18e1525e31bc2524588e5883621beb8c3cf1e6a00ca5e41fb07f

Height

#2,838,898

Difficulty

11.720662

Transactions

6

Size

1.48 KB

Version

2

Bits

0bb87d47

Nonce

198,150,268

Timestamp

9/14/2018, 11:37:32 AM

Confirmations

4,005,933

Merkle Root

667eff78f42f59a4f86f79ba0c4adef4c41abeacda631ae1f41bc3bb6874b5f9
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.291 × 10⁹⁴(95-digit number)
12911247163815456467…15666357362825348919
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.291 × 10⁹⁴(95-digit number)
12911247163815456467…15666357362825348919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.582 × 10⁹⁴(95-digit number)
25822494327630912934…31332714725650697839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.164 × 10⁹⁴(95-digit number)
51644988655261825868…62665429451301395679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.032 × 10⁹⁵(96-digit number)
10328997731052365173…25330858902602791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.065 × 10⁹⁵(96-digit number)
20657995462104730347…50661717805205582719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.131 × 10⁹⁵(96-digit number)
41315990924209460694…01323435610411165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.263 × 10⁹⁵(96-digit number)
82631981848418921389…02646871220822330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.652 × 10⁹⁶(97-digit number)
16526396369683784277…05293742441644661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.305 × 10⁹⁶(97-digit number)
33052792739367568555…10587484883289323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.610 × 10⁹⁶(97-digit number)
66105585478735137111…21174969766578647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.322 × 10⁹⁷(98-digit number)
13221117095747027422…42349939533157294079
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:58,003,057 XPM·at block #6,844,830 · 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