Block #1,534,777

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 11:28:22 AM · Difficulty 10.6180 · 5,273,704 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
398b47f4b66bf8a64bad4a55ba1b9533bd0bf988f1226e304a2f63d45ababd67

Height

#1,534,777

Difficulty

10.617975

Transactions

2

Size

7.61 KB

Version

2

Bits

0a9e3397

Nonce

258,944,751

Timestamp

4/10/2016, 11:28:22 AM

Confirmations

5,273,704

Merkle Root

f2dc6952597b83a8102db0dbf8a07d36fdcd77c338cbd5ad72054c6633bfe68d
Transactions (2)
1 in → 1 out8.9400 XPM110 B
51 in → 1 out3176.6481 XPM7.42 KB
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.

2.305 × 10⁹²(93-digit number)
23050663319255328615…01042140774552319799
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
2.305 × 10⁹²(93-digit number)
23050663319255328615…01042140774552319799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.610 × 10⁹²(93-digit number)
46101326638510657231…02084281549104639599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.220 × 10⁹²(93-digit number)
92202653277021314462…04168563098209279199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.844 × 10⁹³(94-digit number)
18440530655404262892…08337126196418558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.688 × 10⁹³(94-digit number)
36881061310808525784…16674252392837116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.376 × 10⁹³(94-digit number)
73762122621617051569…33348504785674233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.475 × 10⁹⁴(95-digit number)
14752424524323410313…66697009571348467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.950 × 10⁹⁴(95-digit number)
29504849048646820627…33394019142696934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.900 × 10⁹⁴(95-digit number)
59009698097293641255…66788038285393868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.180 × 10⁹⁵(96-digit number)
11801939619458728251…33576076570787737599
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,711,898 XPM·at block #6,808,480 · 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.

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