Block #1,763,088

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2016, 7:25:22 PM · Difficulty 10.7377 · 5,070,394 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bfee6fc2542859c1632d7aa249a2bdb11db5a17ccdaf7b15ba5f4c484e609c33

Height

#1,763,088

Difficulty

10.737659

Transactions

3

Size

3.83 KB

Version

2

Bits

0abcd740

Nonce

194,652,181

Timestamp

9/14/2016, 7:25:22 PM

Confirmations

5,070,394

Merkle Root

9a4837921b7c938d4e8192f56454ef69d4f5e6059bf47cbf533c88895bf3247b
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.

1.942 × 10⁹⁴(95-digit number)
19421267202585882894…29934224953346815999
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
1.942 × 10⁹⁴(95-digit number)
19421267202585882894…29934224953346815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.884 × 10⁹⁴(95-digit number)
38842534405171765789…59868449906693631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.768 × 10⁹⁴(95-digit number)
77685068810343531579…19736899813387263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.553 × 10⁹⁵(96-digit number)
15537013762068706315…39473799626774527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.107 × 10⁹⁵(96-digit number)
31074027524137412631…78947599253549055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.214 × 10⁹⁵(96-digit number)
62148055048274825263…57895198507098111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.242 × 10⁹⁶(97-digit number)
12429611009654965052…15790397014196223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.485 × 10⁹⁶(97-digit number)
24859222019309930105…31580794028392447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.971 × 10⁹⁶(97-digit number)
49718444038619860210…63161588056784895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.943 × 10⁹⁶(97-digit number)
99436888077239720421…26323176113569791999
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,912,060 XPM·at block #6,833,481 · 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