Block #2,131,684

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2017, 6:42:51 AM · Difficulty 10.9102 · 4,677,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c661e95796cbcf68199ed81411b810448b3fa40cac7344650bf61a09fa72a28

Height

#2,131,684

Difficulty

10.910237

Transactions

3

Size

6.56 KB

Version

2

Bits

0ae90552

Nonce

1,929,994,712

Timestamp

5/25/2017, 6:42:51 AM

Confirmations

4,677,764

Merkle Root

008ce16558a6daa72e06ca5616515a8cc37db3df8f7c96bc694cfd21df53d00c
Transactions (3)
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.519 × 10⁹⁶(97-digit number)
25196923500399252483…23671008667949854719
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.519 × 10⁹⁶(97-digit number)
25196923500399252483…23671008667949854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.039 × 10⁹⁶(97-digit number)
50393847000798504966…47342017335899709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.007 × 10⁹⁷(98-digit number)
10078769400159700993…94684034671799418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.015 × 10⁹⁷(98-digit number)
20157538800319401986…89368069343598837759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.031 × 10⁹⁷(98-digit number)
40315077600638803973…78736138687197675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.063 × 10⁹⁷(98-digit number)
80630155201277607946…57472277374395351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.612 × 10⁹⁸(99-digit number)
16126031040255521589…14944554748790702079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.225 × 10⁹⁸(99-digit number)
32252062080511043178…29889109497581404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.450 × 10⁹⁸(99-digit number)
64504124161022086357…59778218995162808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.290 × 10⁹⁹(100-digit number)
12900824832204417271…19556437990325616639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.580 × 10⁹⁹(100-digit number)
25801649664408834542…39112875980651233279
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,719,655 XPM·at block #6,809,447 · 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