1. #6,826,592TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #357,440

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 10:17:16 AM · Difficulty 10.3833 · 6,469,153 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fcb3c3388e15c4cedf22b5b55c01de3b2dab0785d0aa889974fa21bafe0f9bf0

Height

#357,440

Difficulty

10.383252

Transactions

1

Size

596 B

Version

2

Bits

0a621ccc

Nonce

5,990

Timestamp

1/13/2014, 10:17:16 AM

Confirmations

6,469,153

Merkle Root

405ce072c90c56ba1079ac71478a0f0ba68b30a7e9cd8d24729365feebf22506
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.

3.840 × 10⁹⁷(98-digit number)
38407521765632027447…77711229229869757439
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
3.840 × 10⁹⁷(98-digit number)
38407521765632027447…77711229229869757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.681 × 10⁹⁷(98-digit number)
76815043531264054895…55422458459739514879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.536 × 10⁹⁸(99-digit number)
15363008706252810979…10844916919479029759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.072 × 10⁹⁸(99-digit number)
30726017412505621958…21689833838958059519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.145 × 10⁹⁸(99-digit number)
61452034825011243916…43379667677916119039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.229 × 10⁹⁹(100-digit number)
12290406965002248783…86759335355832238079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.458 × 10⁹⁹(100-digit number)
24580813930004497566…73518670711664476159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.916 × 10⁹⁹(100-digit number)
49161627860008995132…47037341423328952319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.832 × 10⁹⁹(100-digit number)
98323255720017990265…94074682846657904639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.966 × 10¹⁰⁰(101-digit number)
19664651144003598053…88149365693315809279
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,856,896 XPM·at block #6,826,592 · 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