{"id":217670,"date":"2025-06-23T08:00:16","date_gmt":"2025-06-23T18:00:16","guid":{"rendered":"https:\/\/www.hawaii.edu\/news\/?p=217670"},"modified":"2025-07-01T15:16:27","modified_gmt":"2025-07-02T01:16:27","slug":"inaugural-marine-debris-hackathon","status":"publish","type":"post","link":"https:\/\/www.hawaii.edu\/news\/2025\/06\/23\/inaugural-marine-debris-hackathon\/","title":{"rendered":"Ghost gear vs<\/abbr>. hackers: Hackathon launched to protect marine life, coral reefs"},"content":{"rendered":"Reading time: <\/span> 2<\/span> minutes<\/span><\/span>
\"people
(Photo credit: Andrew Sullivan-Haskins, PMDP<\/abbr>)<\/figcaption><\/figure>\n

The University of Hawaiʻi<\/span> Sea Grant College Program<\/a> (Hawaiʻi<\/span> Sea Grant) and Papah\u0101naumoku\u0101kea Marine Debris Project<\/a> (PMDP<\/abbr>) have launched the inaugural Marine Debris Hack-A-Thon<\/a>, a cutting-edge challenge that calls on individuals or teams to develop new, innovative tools that can be used to cut and remove derelict fishing nets.<\/p>\n

\"person
(Photo credit: Andrew Sullivan-Haskins, PMDP<\/abbr>)<\/figcaption><\/figure>\n

Derelict fishing gear, often referred to as “ghost gear,” poses a severe risk to marine life, coral reefs and coastal communities. Current methods for removal are often labor-intensive and limited by existing tool capabilities. This competition seeks to harness the collective ingenuity of Hawaiʻi<\/span>\u2019s brightest minds to develop solutions that can make a tangible difference in ocean conservation. Participants are challenged to design and develop next-generation tools to more efficiently cut and remove derelict fishing nets from marine environments.<\/p>\n

\ufeff“This isn’t just a competition, it’s a challenge to push the boundaries of technology,” said Derek LeVault, quartermaster at PMDP<\/abbr>. “We are in constant collaboration with other organizations and interested parties in our field, but the Hack-A-Thon provides a good opportunity to reach beyond that and find some real innovative solutions to our marine debris cutting problems.”<\/p>\n

More than 100,000 pounds of marine debris accumulate each year in Papah\u0101naumok\u0101kea, including massive tangles of fishing nets that can each weigh several tons.<\/p>\n

“Gaining efficiency in cutting the masses of marine debris will free up time to go search for more, resulting in a cleaner sanctuary and less ensnared marine life such as turtles, seals, sharks and the coral reef itself,” LeVault said.<\/p>\n

\"person
(Photo credit: Andrew Sullivan-Haskins, PMDP<\/abbr>)<\/figcaption><\/figure>\n

To participate, individuals or teams must upload a video (under two minutes) or submit a written (maximum one page) introduction of themselves and their proposed tool<\/a>. Submissions are due by July 31, at 11:59 p.m. HST<\/abbr>.<\/p>\n

On December 13, participants will have an opportunity to showcase their designs and compete for the title of hackathon champion at a celebration at the Waik\u012bk\u012b Aquarium. The grand prize winner will be announced immediately following the celebration. Additional information on the grand prize, design requirements, event participation, registration and more will be available soon on the PMDP<\/abbr> website<\/a>.<\/p>\n

—By Cindy Knapman<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"

Innovators are being called to tackle the ghost gear crisis with cutting-edge tech in a new ocean-focused hackathon.<\/p>\n","protected":false},"author":16,"featured_media":217672,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[26],"tags":[1314,107,92,635,9,438],"class_list":["post-217670","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-community","tag-manoa-sustainability","tag-oceanography","tag-school-of-ocean-and-earth-science-and-technology","tag-sea-grant-college-program","tag-uh-manoa","tag-uh-sea-grant","entry","has-media"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t