Block #1,534,577

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 8:20:17 AM · Difficulty 10.6171 · 5,282,340 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37dbf2c8c79adb1929ef24a9af954f233e52cc577253656f8cb4e7c8fab9a537

Height

#1,534,577

Difficulty

10.617111

Transactions

3

Size

15.02 KB

Version

2

Bits

0a9dfb04

Nonce

506,542,831

Timestamp

4/10/2016, 8:20:17 AM

Confirmations

5,282,340

Merkle Root

759502317b00bf76abb40d4e132a6f89babd9f735bb83892814811919a3637d5
Transactions (3)
1 in → 1 out9.0200 XPM109 B
51 in → 1 out2901.2989 XPM7.42 KB
51 in → 1 out1204.4230 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.383 × 10⁹⁵(96-digit number)
13836903210179229682…62641133924121697919
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.383 × 10⁹⁵(96-digit number)
13836903210179229682…62641133924121697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.767 × 10⁹⁵(96-digit number)
27673806420358459364…25282267848243395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.534 × 10⁹⁵(96-digit number)
55347612840716918729…50564535696486791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.106 × 10⁹⁶(97-digit number)
11069522568143383745…01129071392973583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.213 × 10⁹⁶(97-digit number)
22139045136286767491…02258142785947166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.427 × 10⁹⁶(97-digit number)
44278090272573534983…04516285571894333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.855 × 10⁹⁶(97-digit number)
88556180545147069966…09032571143788666879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.771 × 10⁹⁷(98-digit number)
17711236109029413993…18065142287577333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.542 × 10⁹⁷(98-digit number)
35422472218058827986…36130284575154667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.084 × 10⁹⁷(98-digit number)
70844944436117655973…72260569150309335039
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,779,377 XPM·at block #6,816,916 · 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