Block #2,887,129

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/19/2018, 1:34:34 AM · Difficulty 11.6208 · 3,954,580 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9317d2120fd1f52c8dfa639579fea64d20139d734ff38d6696d76adf4dbd5e7c

Height

#2,887,129

Difficulty

11.620803

Transactions

2

Size

1.28 KB

Version

2

Bits

0b9eecea

Nonce

1,471,442,608

Timestamp

10/19/2018, 1:34:34 AM

Confirmations

3,954,580

Merkle Root

1ec0b584fc8af1a84af00a0bb9e6edda4d68c2633665fc37ec4eca399f161a5a
Transactions (2)
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.356 × 10⁹⁴(95-digit number)
53565141638998034744…94593168418351892919
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.356 × 10⁹⁴(95-digit number)
53565141638998034744…94593168418351892919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.071 × 10⁹⁵(96-digit number)
10713028327799606948…89186336836703785839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.142 × 10⁹⁵(96-digit number)
21426056655599213897…78372673673407571679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.285 × 10⁹⁵(96-digit number)
42852113311198427795…56745347346815143359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.570 × 10⁹⁵(96-digit number)
85704226622396855591…13490694693630286719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.714 × 10⁹⁶(97-digit number)
17140845324479371118…26981389387260573439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.428 × 10⁹⁶(97-digit number)
34281690648958742236…53962778774521146879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.856 × 10⁹⁶(97-digit number)
68563381297917484473…07925557549042293759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13712676259583496894…15851115098084587519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.742 × 10⁹⁷(98-digit number)
27425352519166993789…31702230196169175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.485 × 10⁹⁷(98-digit number)
54850705038333987578…63404460392338350079
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,978,051 XPM·at block #6,841,708 · 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