Block #257,687

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/12/2013, 2:44:28 PM · Difficulty 9.9759 · 6,559,009 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0ed12dfe6788e8e418919694604dc24a1f1b6da338c0794c3977bd2473fba898

Height

#257,687

Difficulty

9.975930

Transactions

3

Size

833 B

Version

2

Bits

09f9d68c

Nonce

3,482

Timestamp

11/12/2013, 2:44:28 PM

Confirmations

6,559,009

Merkle Root

3c0a5d5024392f644a9e3971b9985ea390d336c13bd24b4427804ca11b154a55
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.

2.174 × 10⁹⁶(97-digit number)
21742526877488779910…62734122886085429679
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
2.174 × 10⁹⁶(97-digit number)
21742526877488779910…62734122886085429679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.348 × 10⁹⁶(97-digit number)
43485053754977559821…25468245772170859359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.697 × 10⁹⁶(97-digit number)
86970107509955119642…50936491544341718719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.739 × 10⁹⁷(98-digit number)
17394021501991023928…01872983088683437439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.478 × 10⁹⁷(98-digit number)
34788043003982047856…03745966177366874879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.957 × 10⁹⁷(98-digit number)
69576086007964095713…07491932354733749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.391 × 10⁹⁸(99-digit number)
13915217201592819142…14983864709467499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.783 × 10⁹⁸(99-digit number)
27830434403185638285…29967729418934999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.566 × 10⁹⁸(99-digit number)
55660868806371276571…59935458837869998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.113 × 10⁹⁹(100-digit number)
11132173761274255314…19870917675739996159
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,777,690 XPM·at block #6,816,695 · 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