Block #1,575,312

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2016, 8:49:36 PM · Difficulty 10.6940 · 5,242,692 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7ba5389dc69789ec025739a92bf6014bc059efc6c44ce3d2b6fdf47705e742bc

Height

#1,575,312

Difficulty

10.694021

Transactions

2

Size

722 B

Version

2

Bits

0ab1ab63

Nonce

1,687,367,085

Timestamp

5/7/2016, 8:49:36 PM

Confirmations

5,242,692

Merkle Root

a22f2c43d9b968ca70414327a01d81b222c4f59ec6a6935d60f5121974304003
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.

2.943 × 10⁹⁷(98-digit number)
29436520828478380794…72104135949166950399
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.943 × 10⁹⁷(98-digit number)
29436520828478380794…72104135949166950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.887 × 10⁹⁷(98-digit number)
58873041656956761589…44208271898333900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.177 × 10⁹⁸(99-digit number)
11774608331391352317…88416543796667801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.354 × 10⁹⁸(99-digit number)
23549216662782704635…76833087593335603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.709 × 10⁹⁸(99-digit number)
47098433325565409271…53666175186671206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.419 × 10⁹⁸(99-digit number)
94196866651130818543…07332350373342412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.883 × 10⁹⁹(100-digit number)
18839373330226163708…14664700746684825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.767 × 10⁹⁹(100-digit number)
37678746660452327417…29329401493369651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.535 × 10⁹⁹(100-digit number)
75357493320904654834…58658802986739302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.507 × 10¹⁰⁰(101-digit number)
15071498664180930966…17317605973478604799
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