Block #1,534,581

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 8:25:52 AM · Difficulty 10.6171 · 5,282,846 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2829fc35e9414e1801629fa541481aa791cb94238c8dace00e55c06d71a928f7

Height

#1,534,581

Difficulty

10.617134

Transactions

3

Size

15.02 KB

Version

2

Bits

0a9dfc85

Nonce

493,317,717

Timestamp

4/10/2016, 8:25:52 AM

Confirmations

5,282,846

Merkle Root

5a8f5f99df18612c1c2d7d514fa6d0111c5d0564cd6ccca886c5d61d1690a7c3
Transactions (3)
1 in → 1 out9.0200 XPM109 B
51 in → 1 out1206.0577 XPM7.42 KB
51 in → 1 out2902.0807 XPM7.41 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.

1.186 × 10⁹⁶(97-digit number)
11860131909254700364…57801047184120846239
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.186 × 10⁹⁶(97-digit number)
11860131909254700364…57801047184120846239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.372 × 10⁹⁶(97-digit number)
23720263818509400729…15602094368241692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.744 × 10⁹⁶(97-digit number)
47440527637018801458…31204188736483384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.488 × 10⁹⁶(97-digit number)
94881055274037602917…62408377472966769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.897 × 10⁹⁷(98-digit number)
18976211054807520583…24816754945933539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.795 × 10⁹⁷(98-digit number)
37952422109615041166…49633509891867079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.590 × 10⁹⁷(98-digit number)
75904844219230082333…99267019783734159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.518 × 10⁹⁸(99-digit number)
15180968843846016466…98534039567468318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.036 × 10⁹⁸(99-digit number)
30361937687692032933…97068079134936637439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.072 × 10⁹⁸(99-digit number)
60723875375384065867…94136158269873274879
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,783,462 XPM·at block #6,817,426 · 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