Block #1,783,829

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/28/2016, 7:38:12 PM · Difficulty 10.7663 · 5,034,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8340d340410f4c823fdd391d28f10dc69da8d40cc561b344c6c15b4a58fa6382

Height

#1,783,829

Difficulty

10.766328

Transactions

2

Size

1.14 KB

Version

2

Bits

0ac42e16

Nonce

83,199,625

Timestamp

9/28/2016, 7:38:12 PM

Confirmations

5,034,175

Merkle Root

5ebfbe2760f6627f7166f190707036efdce8d1d8fb4009d1523a6e7a1acb948b
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.

7.505 × 10⁹⁴(95-digit number)
75058594464829906544…00909802705570541439
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
7.505 × 10⁹⁴(95-digit number)
75058594464829906544…00909802705570541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.501 × 10⁹⁵(96-digit number)
15011718892965981308…01819605411141082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.002 × 10⁹⁵(96-digit number)
30023437785931962617…03639210822282165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.004 × 10⁹⁵(96-digit number)
60046875571863925235…07278421644564331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.200 × 10⁹⁶(97-digit number)
12009375114372785047…14556843289128663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.401 × 10⁹⁶(97-digit number)
24018750228745570094…29113686578257326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.803 × 10⁹⁶(97-digit number)
48037500457491140188…58227373156514652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.607 × 10⁹⁶(97-digit number)
96075000914982280377…16454746313029304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.921 × 10⁹⁷(98-digit number)
19215000182996456075…32909492626058608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.843 × 10⁹⁷(98-digit number)
38430000365992912150…65818985252117217279
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,788,097 XPM·at block #6,818,003 · 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