Block #2,287,872

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2017, 1:37:43 PM · Difficulty 10.9555 · 4,525,130 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
542089829c15931e9ff53864005bb301931164a03e77c0dc81a1c3513bc93b83

Height

#2,287,872

Difficulty

10.955494

Transactions

11

Size

8.54 KB

Version

2

Bits

0af49b46

Nonce

29,970,403

Timestamp

9/8/2017, 1:37:43 PM

Confirmations

4,525,130

Merkle Root

a69d05ea5da5926aa9c6128813d25688e58343610114c0c9e739011e2ae45fde
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.

8.680 × 10⁹⁶(97-digit number)
86807265562323342213…11953510036186378239
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
8.680 × 10⁹⁶(97-digit number)
86807265562323342213…11953510036186378239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.736 × 10⁹⁷(98-digit number)
17361453112464668442…23907020072372756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.472 × 10⁹⁷(98-digit number)
34722906224929336885…47814040144745512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.944 × 10⁹⁷(98-digit number)
69445812449858673770…95628080289491025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.388 × 10⁹⁸(99-digit number)
13889162489971734754…91256160578982051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.777 × 10⁹⁸(99-digit number)
27778324979943469508…82512321157964103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.555 × 10⁹⁸(99-digit number)
55556649959886939016…65024642315928207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.111 × 10⁹⁹(100-digit number)
11111329991977387803…30049284631856414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.222 × 10⁹⁹(100-digit number)
22222659983954775606…60098569263712829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.444 × 10⁹⁹(100-digit number)
44445319967909551213…20197138527425658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.889 × 10⁹⁹(100-digit number)
88890639935819102426…40394277054851317759
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,748,056 XPM·at block #6,813,001 · 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.

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