Block #428,841

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 9:31:14 AM · Difficulty 10.3425 · 6,379,466 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c1efed3b678380b08862ae59f1b1a18aa67d08550961be0cfec78b1fee4e49e

Height

#428,841

Difficulty

10.342474

Transactions

13

Size

4.43 KB

Version

2

Bits

0a57ac5f

Nonce

15,580

Timestamp

3/4/2014, 9:31:14 AM

Confirmations

6,379,466

Merkle Root

4ffc33b252d24885bc0ed98509693eefcf533f804360a4df254f9e4789278a2c
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.924 × 10⁹⁸(99-digit number)
19245508833675386610…51351459198259472839
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.924 × 10⁹⁸(99-digit number)
19245508833675386610…51351459198259472839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.849 × 10⁹⁸(99-digit number)
38491017667350773220…02702918396518945679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.698 × 10⁹⁸(99-digit number)
76982035334701546440…05405836793037891359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.539 × 10⁹⁹(100-digit number)
15396407066940309288…10811673586075782719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.079 × 10⁹⁹(100-digit number)
30792814133880618576…21623347172151565439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.158 × 10⁹⁹(100-digit number)
61585628267761237152…43246694344303130879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.231 × 10¹⁰⁰(101-digit number)
12317125653552247430…86493388688606261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.463 × 10¹⁰⁰(101-digit number)
24634251307104494861…72986777377212523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.926 × 10¹⁰⁰(101-digit number)
49268502614208989722…45973554754425047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.853 × 10¹⁰⁰(101-digit number)
98537005228417979444…91947109508850094079
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,710,511 XPM·at block #6,808,306 · 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