Block #397,366

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2014, 1:27:48 AM · Difficulty 10.4125 · 6,427,765 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7467adedff488385a57176a4e536fdc9535e71f1c73e91d0c46229ee0d1fb9cf

Height

#397,366

Difficulty

10.412478

Transactions

5

Size

2.64 KB

Version

2

Bits

0a699821

Nonce

28,186,575

Timestamp

2/10/2014, 1:27:48 AM

Confirmations

6,427,765

Merkle Root

3a8c5b8424e45b792195166094d5316b93c420664aadbb51e778aa729507a679
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.728 × 10⁹⁶(97-digit number)
17289474251202506558…02297608631050009599
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.728 × 10⁹⁶(97-digit number)
17289474251202506558…02297608631050009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.457 × 10⁹⁶(97-digit number)
34578948502405013117…04595217262100019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.915 × 10⁹⁶(97-digit number)
69157897004810026234…09190434524200038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.383 × 10⁹⁷(98-digit number)
13831579400962005246…18380869048400076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.766 × 10⁹⁷(98-digit number)
27663158801924010493…36761738096800153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.532 × 10⁹⁷(98-digit number)
55326317603848020987…73523476193600307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.106 × 10⁹⁸(99-digit number)
11065263520769604197…47046952387200614399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.213 × 10⁹⁸(99-digit number)
22130527041539208395…94093904774401228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.426 × 10⁹⁸(99-digit number)
44261054083078416790…88187809548802457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.852 × 10⁹⁸(99-digit number)
88522108166156833580…76375619097604915199
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,845,132 XPM·at block #6,825,130 · 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