Block #478,443

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 2:25:18 AM · Difficulty 10.4925 · 6,330,854 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa4d40d6b3bb7be4adbc6767a802f00575efc38d8b328e294e5d6366728d48ce

Height

#478,443

Difficulty

10.492453

Transactions

1

Size

903 B

Version

2

Bits

0a7e1167

Nonce

35,076

Timestamp

4/7/2014, 2:25:18 AM

Confirmations

6,330,854

Merkle Root

ffc438d8c602f79a4bdc535d38241345a57823e9e9d68b8cc09e57952a537fc3
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.009 × 10⁹⁹(100-digit number)
10099948271383633454…45110898489036455199
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.009 × 10⁹⁹(100-digit number)
10099948271383633454…45110898489036455199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.019 × 10⁹⁹(100-digit number)
20199896542767266908…90221796978072910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.039 × 10⁹⁹(100-digit number)
40399793085534533817…80443593956145820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.079 × 10⁹⁹(100-digit number)
80799586171069067634…60887187912291641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.615 × 10¹⁰⁰(101-digit number)
16159917234213813526…21774375824583283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.231 × 10¹⁰⁰(101-digit number)
32319834468427627053…43548751649166566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.463 × 10¹⁰⁰(101-digit number)
64639668936855254107…87097503298333132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.292 × 10¹⁰¹(102-digit number)
12927933787371050821…74195006596666265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.585 × 10¹⁰¹(102-digit number)
25855867574742101642…48390013193332531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.171 × 10¹⁰¹(102-digit number)
51711735149484203285…96780026386665062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.034 × 10¹⁰²(103-digit number)
10342347029896840657…93560052773330124799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,718,446 XPM·at block #6,809,296 · 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