Block #1,533,113

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2016, 8:08:12 AM · Difficulty 10.6163 · 5,308,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a20761ae5cd3654b93eec95e9dfdfb0be26a97b48f8989b2c43116aafc6c415e

Height

#1,533,113

Difficulty

10.616340

Transactions

2

Size

970 B

Version

2

Bits

0a9dc871

Nonce

1,698,625,803

Timestamp

4/9/2016, 8:08:12 AM

Confirmations

5,308,718

Merkle Root

ec887460de1582a7f2d2cb0d3ce8b82052a19a4fb80168d76f978d67a423c36e
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.653 × 10⁹⁵(96-digit number)
26530573479230972742…43120016009485796799
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.653 × 10⁹⁵(96-digit number)
26530573479230972742…43120016009485796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.306 × 10⁹⁵(96-digit number)
53061146958461945484…86240032018971593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.061 × 10⁹⁶(97-digit number)
10612229391692389096…72480064037943187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.122 × 10⁹⁶(97-digit number)
21224458783384778193…44960128075886374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.244 × 10⁹⁶(97-digit number)
42448917566769556387…89920256151772748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.489 × 10⁹⁶(97-digit number)
84897835133539112775…79840512303545497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.697 × 10⁹⁷(98-digit number)
16979567026707822555…59681024607090995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.395 × 10⁹⁷(98-digit number)
33959134053415645110…19362049214181990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.791 × 10⁹⁷(98-digit number)
67918268106831290220…38724098428363980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.358 × 10⁹⁸(99-digit number)
13583653621366258044…77448196856727961599
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,979,022 XPM·at block #6,841,830 · 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