Block #1,791,017

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/3/2016, 6:05:10 PM · Difficulty 10.7703 · 5,050,486 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c863351546b64ac51dc74d67ee7dd151a07fc99607c922fac785654866248ca

Height

#1,791,017

Difficulty

10.770311

Transactions

2

Size

866 B

Version

2

Bits

0ac5331f

Nonce

433,094,816

Timestamp

10/3/2016, 6:05:10 PM

Confirmations

5,050,486

Merkle Root

f4166a7e87228cebec9ecbc76660c06cde19420dc1e4bc3f0382a5faa2d77fae
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.

5.242 × 10⁹³(94-digit number)
52429594588764463510…27210717363235995341
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
5.242 × 10⁹³(94-digit number)
52429594588764463510…27210717363235995341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.048 × 10⁹⁴(95-digit number)
10485918917752892702…54421434726471990681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.097 × 10⁹⁴(95-digit number)
20971837835505785404…08842869452943981361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.194 × 10⁹⁴(95-digit number)
41943675671011570808…17685738905887962721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.388 × 10⁹⁴(95-digit number)
83887351342023141617…35371477811775925441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.677 × 10⁹⁵(96-digit number)
16777470268404628323…70742955623551850881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.355 × 10⁹⁵(96-digit number)
33554940536809256646…41485911247103701761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.710 × 10⁹⁵(96-digit number)
67109881073618513293…82971822494207403521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.342 × 10⁹⁶(97-digit number)
13421976214723702658…65943644988414807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.684 × 10⁹⁶(97-digit number)
26843952429447405317…31887289976829614081
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,976,402 XPM·at block #6,841,502 · 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