Block #2,129,908

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2017, 1:52:33 AM · Difficulty 10.9094 · 4,714,053 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
516ab896805ab83d5e158f1799a7fedef46dac981453113ecd12757418c97bb1

Height

#2,129,908

Difficulty

10.909364

Transactions

4

Size

992 B

Version

2

Bits

0ae8cc18

Nonce

720,637,273

Timestamp

5/24/2017, 1:52:33 AM

Confirmations

4,714,053

Merkle Root

1b20564a914baf119f9973105f49449a6c663d68b915ff5061185ab8881bb19e
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.

1.368 × 10⁹⁴(95-digit number)
13681554431301223473…02997555269244411759
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
1.368 × 10⁹⁴(95-digit number)
13681554431301223473…02997555269244411759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.736 × 10⁹⁴(95-digit number)
27363108862602446947…05995110538488823519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.472 × 10⁹⁴(95-digit number)
54726217725204893895…11990221076977647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.094 × 10⁹⁵(96-digit number)
10945243545040978779…23980442153955294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.189 × 10⁹⁵(96-digit number)
21890487090081957558…47960884307910588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.378 × 10⁹⁵(96-digit number)
43780974180163915116…95921768615821176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.756 × 10⁹⁵(96-digit number)
87561948360327830232…91843537231642352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.751 × 10⁹⁶(97-digit number)
17512389672065566046…83687074463284705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.502 × 10⁹⁶(97-digit number)
35024779344131132093…67374148926569410559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.004 × 10⁹⁶(97-digit number)
70049558688262264186…34748297853138821119
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,996,065 XPM·at block #6,843,960 · 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