Block #2,110,964

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2017, 3:00:52 AM · Difficulty 10.9033 · 4,730,986 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a22a8eeeff729435e2650d93b4a2fac022b4a5620e30e424f421864510536f80

Height

#2,110,964

Difficulty

10.903310

Transactions

2

Size

426 B

Version

2

Bits

0ae73f56

Nonce

1,137,901,976

Timestamp

5/11/2017, 3:00:52 AM

Confirmations

4,730,986

Merkle Root

6a1a00a8e885d57bc1e853d0a834b4f7da5a2b7f9ab95a0220eea500cfcfa968
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.

1.012 × 10⁹⁴(95-digit number)
10126551285064747700…27154725260655887999
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.012 × 10⁹⁴(95-digit number)
10126551285064747700…27154725260655887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.025 × 10⁹⁴(95-digit number)
20253102570129495400…54309450521311775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.050 × 10⁹⁴(95-digit number)
40506205140258990800…08618901042623551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.101 × 10⁹⁴(95-digit number)
81012410280517981601…17237802085247103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.620 × 10⁹⁵(96-digit number)
16202482056103596320…34475604170494207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.240 × 10⁹⁵(96-digit number)
32404964112207192640…68951208340988415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.480 × 10⁹⁵(96-digit number)
64809928224414385280…37902416681976831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.296 × 10⁹⁶(97-digit number)
12961985644882877056…75804833363953663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.592 × 10⁹⁶(97-digit number)
25923971289765754112…51609666727907327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.184 × 10⁹⁶(97-digit number)
51847942579531508224…03219333455814655999
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,979,980 XPM·at block #6,841,949 · 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