Block #1,763,794

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/15/2016, 7:02:20 AM · Difficulty 10.7382 · 5,053,521 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c058f89839e900a35baf362783b56febc2fd5c31b093da8ba2bc6472f6e3d07e

Height

#1,763,794

Difficulty

10.738176

Transactions

2

Size

7.36 KB

Version

2

Bits

0abcf914

Nonce

334,069,260

Timestamp

9/15/2016, 7:02:20 AM

Confirmations

5,053,521

Merkle Root

767cbe9a6d183a55b1c0c1a441fc7dedd7330190e4f46cc78a26b5703e5f6654
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.

4.619 × 10⁹²(93-digit number)
46192113630806014303…63912388793174173359
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.619 × 10⁹²(93-digit number)
46192113630806014303…63912388793174173359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.238 × 10⁹²(93-digit number)
92384227261612028607…27824777586348346719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.847 × 10⁹³(94-digit number)
18476845452322405721…55649555172696693439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.695 × 10⁹³(94-digit number)
36953690904644811442…11299110345393386879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.390 × 10⁹³(94-digit number)
73907381809289622885…22598220690786773759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.478 × 10⁹⁴(95-digit number)
14781476361857924577…45196441381573547519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.956 × 10⁹⁴(95-digit number)
29562952723715849154…90392882763147095039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.912 × 10⁹⁴(95-digit number)
59125905447431698308…80785765526294190079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.182 × 10⁹⁵(96-digit number)
11825181089486339661…61571531052588380159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.365 × 10⁹⁵(96-digit number)
23650362178972679323…23143062105176760319
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,782,565 XPM·at block #6,817,314 · 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