Block #2,862,685

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/1/2018, 12:56:18 PM · Difficulty 11.6754 · 3,974,228 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dbbb761b2127f4b1e7380ba92049ba62dc2f7d5d932b3515ac0431b557e76b01

Height

#2,862,685

Difficulty

11.675364

Transactions

36

Size

10.84 KB

Version

2

Bits

0bace4a3

Nonce

1,048,589,704

Timestamp

10/1/2018, 12:56:18 PM

Confirmations

3,974,228

Merkle Root

1de41a1b3d7779283f095c08a5682f23d13353b66cc8bb3734160c1e89ecc56c
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.878 × 10⁹⁴(95-digit number)
58782563124215742888…69800246896798358239
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.878 × 10⁹⁴(95-digit number)
58782563124215742888…69800246896798358239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.175 × 10⁹⁵(96-digit number)
11756512624843148577…39600493793596716479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.351 × 10⁹⁵(96-digit number)
23513025249686297155…79200987587193432959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.702 × 10⁹⁵(96-digit number)
47026050499372594310…58401975174386865919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.405 × 10⁹⁵(96-digit number)
94052100998745188621…16803950348773731839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.881 × 10⁹⁶(97-digit number)
18810420199749037724…33607900697547463679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.762 × 10⁹⁶(97-digit number)
37620840399498075448…67215801395094927359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.524 × 10⁹⁶(97-digit number)
75241680798996150897…34431602790189854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.504 × 10⁹⁷(98-digit number)
15048336159799230179…68863205580379709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.009 × 10⁹⁷(98-digit number)
30096672319598460358…37726411160759418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.019 × 10⁹⁷(98-digit number)
60193344639196920717…75452822321518837759
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,939,598 XPM·at block #6,836,912 · 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