Block #2,185,072

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/29/2017, 6:07:22 PM · Difficulty 10.9442 · 4,631,714 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd6d164cd3134a18194f5d74597f00c422bf470fb6ff605ac90f34b9159e8392

Height

#2,185,072

Difficulty

10.944163

Transactions

3

Size

1.72 KB

Version

2

Bits

0af1b4ad

Nonce

659,456,805

Timestamp

6/29/2017, 6:07:22 PM

Confirmations

4,631,714

Merkle Root

b098a48106fb4afa615309259bd44c3752cb2a9c45a4341f5afd27691765648f
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.992 × 10⁹⁴(95-digit number)
29925629456829986540…38215952881282184959
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.992 × 10⁹⁴(95-digit number)
29925629456829986540…38215952881282184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.985 × 10⁹⁴(95-digit number)
59851258913659973080…76431905762564369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.197 × 10⁹⁵(96-digit number)
11970251782731994616…52863811525128739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.394 × 10⁹⁵(96-digit number)
23940503565463989232…05727623050257479679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.788 × 10⁹⁵(96-digit number)
47881007130927978464…11455246100514959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.576 × 10⁹⁵(96-digit number)
95762014261855956928…22910492201029918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.915 × 10⁹⁶(97-digit number)
19152402852371191385…45820984402059837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.830 × 10⁹⁶(97-digit number)
38304805704742382771…91641968804119674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.660 × 10⁹⁶(97-digit number)
76609611409484765542…83283937608239349759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.532 × 10⁹⁷(98-digit number)
15321922281896953108…66567875216478699519
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,778,323 XPM·at block #6,816,785 · 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