Block #2,153,970

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/10/2017, 12:37:02 AM · Difficulty 10.9037 · 4,684,416 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01535dabc449a5fbd70347d1347a9a0fe6ee5b168388404ee9d83e8e3f528134

Height

#2,153,970

Difficulty

10.903683

Transactions

4

Size

1.73 KB

Version

2

Bits

0ae757c3

Nonce

1,896,696,132

Timestamp

6/10/2017, 12:37:02 AM

Confirmations

4,684,416

Merkle Root

707c581a01e9de62775410a753b1e579ca7182d762cf89cba25c56a9211c4e62
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.

2.102 × 10⁹⁶(97-digit number)
21024889763135893349…01568566766636052479
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
2.102 × 10⁹⁶(97-digit number)
21024889763135893349…01568566766636052479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.204 × 10⁹⁶(97-digit number)
42049779526271786699…03137133533272104959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.409 × 10⁹⁶(97-digit number)
84099559052543573399…06274267066544209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.681 × 10⁹⁷(98-digit number)
16819911810508714679…12548534133088419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.363 × 10⁹⁷(98-digit number)
33639823621017429359…25097068266176839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.727 × 10⁹⁷(98-digit number)
67279647242034858719…50194136532353679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.345 × 10⁹⁸(99-digit number)
13455929448406971743…00388273064707358719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.691 × 10⁹⁸(99-digit number)
26911858896813943487…00776546129414717439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.382 × 10⁹⁸(99-digit number)
53823717793627886975…01553092258829434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.076 × 10⁹⁹(100-digit number)
10764743558725577395…03106184517658869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.152 × 10⁹⁹(100-digit number)
21529487117451154790…06212369035317739519
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,951,360 XPM·at block #6,838,385 · 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