Block #340,736

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 11:54:06 PM · Difficulty 10.1330 · 6,474,180 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7444be0717ebe3411f5741c6d0e2f71bb8539ee3efe8013d6dd21e32ae715768

Height

#340,736

Difficulty

10.132992

Transactions

4

Size

1.00 KB

Version

2

Bits

0a220bc3

Nonce

84,270

Timestamp

1/2/2014, 11:54:06 PM

Confirmations

6,474,180

Merkle Root

2a0a7ab478d2ae0e25838f08eea609b90cbd3b1f1cb260fbad320b046c8457d8
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.

9.832 × 10⁹⁸(99-digit number)
98328847997434569587…64758800034386083839
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
9.832 × 10⁹⁸(99-digit number)
98328847997434569587…64758800034386083839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.966 × 10⁹⁹(100-digit number)
19665769599486913917…29517600068772167679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.933 × 10⁹⁹(100-digit number)
39331539198973827835…59035200137544335359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.866 × 10⁹⁹(100-digit number)
78663078397947655670…18070400275088670719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.573 × 10¹⁰⁰(101-digit number)
15732615679589531134…36140800550177341439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.146 × 10¹⁰⁰(101-digit number)
31465231359179062268…72281601100354682879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.293 × 10¹⁰⁰(101-digit number)
62930462718358124536…44563202200709365759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.258 × 10¹⁰¹(102-digit number)
12586092543671624907…89126404401418731519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.517 × 10¹⁰¹(102-digit number)
25172185087343249814…78252808802837463039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.034 × 10¹⁰¹(102-digit number)
50344370174686499629…56505617605674926079
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,763,420 XPM·at block #6,814,915 · 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