Block #419,554

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 5:47:30 PM · Difficulty 10.3763 · 6,391,028 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc75f06a4ab793c079bbba1cf493b4bc5820929d92d75fbcbfa94f53fda21476

Height

#419,554

Difficulty

10.376292

Transactions

7

Size

1.88 KB

Version

2

Bits

0a6054a8

Nonce

412,942

Timestamp

2/25/2014, 5:47:30 PM

Confirmations

6,391,028

Merkle Root

1199ad8830eb96c3af8176455fd88d92ce5ae37f4076b34d4a21c5cde1af08c4
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.

6.870 × 10¹⁰³(104-digit number)
68707056711369905355…31934979287978864639
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
6.870 × 10¹⁰³(104-digit number)
68707056711369905355…31934979287978864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.374 × 10¹⁰⁴(105-digit number)
13741411342273981071…63869958575957729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.748 × 10¹⁰⁴(105-digit number)
27482822684547962142…27739917151915458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.496 × 10¹⁰⁴(105-digit number)
54965645369095924284…55479834303830917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.099 × 10¹⁰⁵(106-digit number)
10993129073819184856…10959668607661834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.198 × 10¹⁰⁵(106-digit number)
21986258147638369713…21919337215323668479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.397 × 10¹⁰⁵(106-digit number)
43972516295276739427…43838674430647336959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.794 × 10¹⁰⁵(106-digit number)
87945032590553478854…87677348861294673919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.758 × 10¹⁰⁶(107-digit number)
17589006518110695770…75354697722589347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.517 × 10¹⁰⁶(107-digit number)
35178013036221391541…50709395445178695679
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,728,748 XPM·at block #6,810,581 · 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.

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