Block #2,862,987

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/1/2018, 6:25:02 PM · Difficulty 11.6738 · 3,979,801 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48a9f804dd0aaa14380aa800afa7358f6c462bd916e87f9a939048d4d7506b0c

Height

#2,862,987

Difficulty

11.673751

Transactions

4

Size

1.56 KB

Version

2

Bits

0bac7aed

Nonce

794,848,341

Timestamp

10/1/2018, 6:25:02 PM

Confirmations

3,979,801

Merkle Root

9da423cab3e76537b9ae18925f971d67c478d7648b6c67b4165fc90a85b15c89
Transactions (4)
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.

6.291 × 10⁹³(94-digit number)
62911148280803598583…15648076616934624479
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
6.291 × 10⁹³(94-digit number)
62911148280803598583…15648076616934624479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.258 × 10⁹⁴(95-digit number)
12582229656160719716…31296153233869248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.516 × 10⁹⁴(95-digit number)
25164459312321439433…62592306467738497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.032 × 10⁹⁴(95-digit number)
50328918624642878866…25184612935476995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.006 × 10⁹⁵(96-digit number)
10065783724928575773…50369225870953991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.013 × 10⁹⁵(96-digit number)
20131567449857151546…00738451741907983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.026 × 10⁹⁵(96-digit number)
40263134899714303093…01476903483815966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.052 × 10⁹⁵(96-digit number)
80526269799428606186…02953806967631933439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.610 × 10⁹⁶(97-digit number)
16105253959885721237…05907613935263866879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.221 × 10⁹⁶(97-digit number)
32210507919771442474…11815227870527733759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.442 × 10⁹⁶(97-digit number)
64421015839542884949…23630455741055467519
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,986,645 XPM·at block #6,842,787 · 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