Block #377,072

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2014, 8:25:18 PM · Difficulty 10.4254 · 6,433,865 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
97f1cf3ff21ab8bede0b4dfb57d431213f8bd7e0186ed25e1d86183d3102d7e8

Height

#377,072

Difficulty

10.425396

Transactions

7

Size

1.52 KB

Version

2

Bits

0a6ce6c5

Nonce

26,550

Timestamp

1/26/2014, 8:25:18 PM

Confirmations

6,433,865

Merkle Root

7ec589aeb25f7c873afe9d2592b3d9139d24993b4157a7d5d8337ea3078c2299
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.170 × 10⁹⁹(100-digit number)
11700406661621392899…88879343273136986879
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.170 × 10⁹⁹(100-digit number)
11700406661621392899…88879343273136986879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.340 × 10⁹⁹(100-digit number)
23400813323242785798…77758686546273973759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.680 × 10⁹⁹(100-digit number)
46801626646485571597…55517373092547947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.360 × 10⁹⁹(100-digit number)
93603253292971143194…11034746185095895039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.872 × 10¹⁰⁰(101-digit number)
18720650658594228638…22069492370191790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.744 × 10¹⁰⁰(101-digit number)
37441301317188457277…44138984740383580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.488 × 10¹⁰⁰(101-digit number)
74882602634376914555…88277969480767160319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.497 × 10¹⁰¹(102-digit number)
14976520526875382911…76555938961534320639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.995 × 10¹⁰¹(102-digit number)
29953041053750765822…53111877923068641279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.990 × 10¹⁰¹(102-digit number)
59906082107501531644…06223755846137282559
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,731,600 XPM·at block #6,810,936 · 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