Block #1,547,577

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2016, 12:04:22 AM · Difficulty 10.6562 · 5,279,185 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bb43e319437ed4ab8728eed07cd7e58bcb9bddfe8380096d02346e683dc2ee91

Height

#1,547,577

Difficulty

10.656246

Transactions

2

Size

798 B

Version

2

Bits

0aa7ffbb

Nonce

1,632,536,255

Timestamp

4/19/2016, 12:04:22 AM

Confirmations

5,279,185

Merkle Root

85da40ef665ef5b6bfee23e20323a1a64ea56130f2a89840906e0af8d479e3c0
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.208 × 10⁹⁴(95-digit number)
12088997377900739842…55241029822608468799
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.208 × 10⁹⁴(95-digit number)
12088997377900739842…55241029822608468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.417 × 10⁹⁴(95-digit number)
24177994755801479684…10482059645216937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.835 × 10⁹⁴(95-digit number)
48355989511602959369…20964119290433875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.671 × 10⁹⁴(95-digit number)
96711979023205918738…41928238580867750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.934 × 10⁹⁵(96-digit number)
19342395804641183747…83856477161735500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.868 × 10⁹⁵(96-digit number)
38684791609282367495…67712954323471001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.736 × 10⁹⁵(96-digit number)
77369583218564734990…35425908646942003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.547 × 10⁹⁶(97-digit number)
15473916643712946998…70851817293884006399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.094 × 10⁹⁶(97-digit number)
30947833287425893996…41703634587768012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.189 × 10⁹⁶(97-digit number)
61895666574851787992…83407269175536025599
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,858,255 XPM·at block #6,826,761 · 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