Block #1,730,317

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2016, 8:19:08 AM · Difficulty 10.7135 · 5,086,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9395fb887c7be666dac7c4d721e65229ef47ed13379275831311746f54e41104

Height

#1,730,317

Difficulty

10.713481

Transactions

2

Size

34.53 KB

Version

2

Bits

0ab6a6b3

Nonce

519,449,914

Timestamp

8/23/2016, 8:19:08 AM

Confirmations

5,086,541

Merkle Root

739fb559cae82799eb0829aaef996a12783748d8b44c438be987022c0328ac08
Transactions (2)
1 in → 1 out9.0800 XPM110 B
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.

4.015 × 10⁹³(94-digit number)
40158505213347650680…82857313741293606079
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
4.015 × 10⁹³(94-digit number)
40158505213347650680…82857313741293606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.031 × 10⁹³(94-digit number)
80317010426695301360…65714627482587212159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.606 × 10⁹⁴(95-digit number)
16063402085339060272…31429254965174424319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.212 × 10⁹⁴(95-digit number)
32126804170678120544…62858509930348848639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.425 × 10⁹⁴(95-digit number)
64253608341356241088…25717019860697697279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.285 × 10⁹⁵(96-digit number)
12850721668271248217…51434039721395394559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.570 × 10⁹⁵(96-digit number)
25701443336542496435…02868079442790789119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.140 × 10⁹⁵(96-digit number)
51402886673084992870…05736158885581578239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.028 × 10⁹⁶(97-digit number)
10280577334616998574…11472317771163156479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.056 × 10⁹⁶(97-digit number)
20561154669233997148…22944635542326312959
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,907 XPM·at block #6,816,857 · 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